Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

@article{Graham1977OptimizationAA,
  title={Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey},
  author={Ronald L. Graham and Eugene L. Lawler and Jan Karel Lenstra and Alexander H. G. Rinnooy Kan},
  journal={Annals of discrete mathematics},
  year={1977},
  volume={5},
  pages={287-326}
}
The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. In this paper we survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory. Special cases considered are single machine scheduling, identical, uniform and unrelated parallel machine scheduling, and open shop, flow shop and job shop scheduling. We indicate some problems for future research and include a… 
Recent developments in deterministic sequencing and scheduling: a survey : (preprint)
TLDR
The state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory are surveyed.
Scheduling subject to resource constraints: classification and complexity
TLDR
A classification scheme for resource constraints is proposed and the computational complexity of the extended problem class is investigated in terms of this classification.
EFFICIENT HEURISTIC OPTIMIZATION IN SINGLE MACHINE SCHEDULING
TLDR
A comparison of heuristic optimization algorithms for single machine scheduling problems with and without arbitrary job release times and the effects of arbitrary release times on problem difficulty and required computation time is presented.
Sequencing and scheduling: algorithms and complexity
TLDR
This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
An algorithm for single machine sequencing with release dates to minimize maximum cost
TLDR
An algorithm of the branch-and-bound type for minimizing maximum cost is proposed, based on the eliminative properties of a block of jobs, which has solved test problems with 300 jobs.
Complexity results for scheduling chains on a single machine : (preprint)
TLDR
NP-hardness is established for the cases in which the number of late jobs or the total weighted tardiness is to be minimized, and for several related problems involving the total Weighted completion time criterion.
Approximation for preemptive scheduling stochastic jobs on identical parallel machines
  • Xiaoyong Tang, Kenli Li, Fan Wu
  • Computer Science
    2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)
  • 2010
TLDR
This paper extends the stochastic single-machine preemptive WSEPT rule to a multi-machine list scheduling policy, which it is called P-WSEPT, and uses LP based policy to analysis the performance guarantee of preemptive stochastically scheduling with release dates.
Exact and heuristic algorithms for parallel-machine scheduling with learning effect
In this paper we focus on parallel-machine scheduling g problem. The objective is to minimize the makespan. This problem is an NP-hard problem. We propose three heuristics and a branch-and-bound
New trends in machine scheduling
Abstract This review is concerned with new directions in deterministic machine scheduling theory. We study: resource constrained scheduling, scheduling tasks that require more than one machine at a
Parallel machine scheduling with machine availability and eligibility constraints
TLDR
A polynomial time binary search algorithm is proposed to solve the problem of scheduling n independent jobs on m identical machines incorporating machine availability and eligibility constraints while minimizing the makespan.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 110 REFERENCES
Scheduling with parallel processors and linear delay costs
TLDR
The theoretical properties of this m-machine problem are explored, and the problem of determining an optimum scheduling procedure is examined; properties of the optimum schedule are given as well as the corresponding reductions in the number of schedules that must be evaluated in the search for an optimum.
On the Scheduling of Jobs on a Number of Identical Machines.
Abstract : Several theoretical results are developed to obtain an efficient branch-and-bound algorithm for the sequencing problem when all jobs are available to process at time zero and are
Complexity of machine scheduling problems
TLDR
A classification of scheduling problems on single, different and identical machines is given and NP-completeness is established for a large number of other machine scheduling problems.
Algorithms for Scheduling Independent Tasks
TLDR
Three general techniques are presented to obtain approximate solutions for optimization problems solvable in this way, and polynomial time algorithms are applied to obtain “good” approximate solutions.
Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure
TLDR
Some computational experience with the algorithm proposed previously and a discussion of the structural aspects of the problem provide insight into the structure of the aggregate-detailed cost trade-off problem and suggest a good heuristic decision rule for problems of realistic size and complexity.
Heuristics in Job Shop Scheduling
TLDR
The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority rules for determining sequences of jobs on the machines, a number of heuristics or rules of thumb are incorporated.
Job-Shop Scheduling by Implicit Enumeration
The classical combinatorial optimization problem of minimizing maximum completion time in a general job-shop has been the subject of extensive research. In this paper we review and extend this work.
Bounds for the Optimal Scheduling of n Jobs on m Processors
TLDR
Lower and upper bounds are given for the cost of an optimal schedule and a procedure is described for obtaining a schedule which costs less than the given upper bound.
Complexity of Scheduling under Precedence Constraints
TLDR
The use of precedence constraints between jobs that have to be respected in every feasible schedule is illustrated by extending some typical NP-completeness results and simplifying their correctness proofs for scheduling problems involving precedence constraints.
Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
TLDR
This paper presents a formal model of the one-machine job-shop scheduling problem with variable capacity and outlines a preliminary branch-and-bound algorithm, and illustrates several interesting features of the algorithm and bounding structures by an example.
...
1
2
3
4
5
...