Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

  title={Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey},
  author={Ron Graham and Eugene L. Lawler and Jan Karel Lenstra and Alexander H. G. Rinnooy Kan},
  journal={Annals of discrete mathematics},
Recent developments in deterministic sequencing and scheduling: a survey : (preprint)
The state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory are surveyed.
Sequencing and scheduling: algorithms and complexity
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.
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.
Approximation for preemptive scheduling stochastic jobs on identical parallel machines
  • Xiaoyong Tang, Kenli Li, Fan Wu
  • Business
    2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)
  • 2010
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
This paper proposes three heuristics and a branch-and-bound exact algorithm for parallel-machine scheduling g problem and uses the exact algorithms to applicate results for scheduling algorithms for the problem.
An approximation algorithm for parallel machine scheduling with simple linear deterioration
In this paper, a parallel machine scheduling problem was considered, where the processing time of a job is a simple linear function of its starting time. The objective is to minimize makespan. A


Scheduling with parallel processors and linear delay costs
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
Algorithms for Scheduling Independent Tasks
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.
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
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
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
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.
Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
It is proved that a permutation is optimal if and only if it can be generated by this algorithm, and four special network structures are considered, and specializations of the general algorithm are presented.
Minimizing maximum lateness on one machine : Computational experience and some applications
This work considers the problem of scheduling jobs on a single machine subject to given release dates and precedence constraints, and describes applications to the theory of job-shop scheduling and to a practical scheduling situation.