Open Shop Scheduling to Minimize Finish Time

Cited in

(only showing first 100 items - show all)

A genetic algorithm for the proportionate multiprocessor open shop
Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
Scheduling incompatible tasks on two machines
On the complexity of preemptive open-shop scheduling problems
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
The mixed shop scheduling problem
Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
Scheduling periodically occurring tasks on multiple processors
Scheduling open shops with parallel machines
On the complexity of generalized due date scheduling problems
The complexity of shop-scheduling problems with two or three jobs
On the optimality of static policy in stochastic open shop
Two scheduling problems with fuzzy due-dates
Open shop scheduling with machine dependent processing times
The generalized shifting bottleneck procedure
Extensions of coloring models for scheduling purposes
Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
Approximability of flow shop scheduling
Makespan minimization in open shops: A polynomial time approximation scheme
Minimizing average completion time in the presence of release dates
Approximation algorithms for two-machine flow shop scheduling with batch setup times
Classical and new heuristics for the open-shop problem: A computational evaluation
A heuristic for the two-machine open-shop scheduling problem with transportation times
Approximation algorithms for the multiprocessor open shop scheduling problem
Lot streaming in open shops
Worst-case analysis of heuristics for open shops with parallel machines
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
Constructive heuristic algorithms for the open shop problem
Scheduling two jobs with fixed and nonfixed routes
Scheduling unit time open shops to minimize the weighted number of late jobs
A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem
Lot streaming in three-stage production processes
Two machine open shop scheduling problems with bi-criteria
On the complexity of preemptive openshop scheduling problems
On some geometric methods in scheduling theory: A survey
Complexity analysis of job-shop scheduling with deteriorating jobs
A branch \(\&\) bound algorithm for the open-shop problem
Open shop problem with zero-one time operations and integer release date/deadline intervals
An open shop scheduling problem with a non-bottleneck machine
Two-stage no-wait scheduling models with setup and removal times separated
Open shop scheduling with maximal machines
A tabu search algorithm for the open shop problem
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
New bounds for optimum traffic assignment in satellite communication.
Scheduling problems for parallel dedicated machines under multiple resource constraints.
Open shop scheduling problems with late work criteria.
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
A hybrid genetic algorithm for the open shop scheduling problem
Group technology approach to the open shop scheduling problem with batch setup times
Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
Flow shop and open shop scheduling with a critical machine and two operations per job
Two-stage open shop scheduling with a bottleneck machine
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
Local search with constraint propagation and conflict-based heuristics
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
Scheduling on power-heterogeneous processors
Partially concurrent open shop scheduling with integral preemptions
Open shop scheduling with synchronization
Open shop cyclic scheduling
New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
Chromatic scheduling in a cyclic open shop
An introduction to multi-parameter complexity analysis of discrete problems
A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
Parameterized complexity of machine scheduling: 15 open problems
Two-machine shop scheduling problems with batch processing
Polynomial time approximation algorithms for machine scheduling: Ten open problems
An iterative improvement approach for the nonpreemptive open shop scheduling problem
The two-machine open shop problem: To fit or not to fit, that is the question
A polynomial-time open-shop problem with an arbitrary number of machines
Reversible-shop scheduling
Two machine mixed shop scheduling problem with controllable machine speeds
The complexity of two group scheduling problems
A linear time approximation scheme for makespan minimization in an open shop with release dates
Scheduling parallel dedicated machines under a single non-shared resource
Scheduling two-machine preemptive open shops to minimize total completion time
Scheduling shops to minimize the weighted number of late jobs
NP-hardness of shop-scheduling problems with three jobs
Shop scheduling problems with multiprocessor tasks on dedicated processors
Asymptotic optimality of statistical multiplexing in pipelined processing
Open shop scheduling with some additional constraints
Open shop, satellite communication and a theorem by Egerváry (1931)
Unbounded parallel-batch scheduling with family jobs and delivery coordination
Complexity of mixed shop scheduling problems: A survey
On a conjecture for the university timetabling problem
Dynamic programming approach for solving the open shop problem
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
Three-machine open shop with a bottleneck machine revisited
Two-machine routing open shop: How long is the optimal makespan?
A PTAS for non-resumable open shop scheduling with an availability constraint
Exponential tightness for integral-type functionals of centered independent differently distributed random variables
New efficient heuristics for scheduling open shops with makespan minimization
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
Open shop scheduling problem with a non-resumable flexible maintenance period
A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
Matching and scheduling of student-company-talks for a university it-speed dating event
A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

This page was built for publication: Open Shop Scheduling to Minimize Finish Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111095)