Location of Repository

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms, and enhanced scheduling models

Topics:
TA

Year: 2009

OAI identifier:
oai:eprints.soton.ac.uk:145495

Provided by:
e-Prints Soton

Downloaded from
http://dx.doi.org/10.1057/jors.2009.2

- (1958a). Linear Programming with Pattern Constraints.
- (1958b). A solution to the traveling-salesman problem. Presentation at the American Summer Meeting of the Econometric Society,
- (1977). A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness.
- (1985). A branch and bound algorithm for the total weighted tatrdiness problem.
- (1965). A branch-and-bound algorithm for the exact solution of the threemachine scheduling problem.
- (1983). A concise survey of eﬃciently solvable cases of the permutation ﬂow-shop problem.
- (1988). A controlled search simulated annealing method for the general problem, Working paper 03-04-88,
- (1989). A controlled search simulated annealing method for the single machine weighted tardiness problem.
- (1982). A decomposition algorithm for the single machine total tardiness problem.
- (1976). A dual algorithm for the one-machine scheduling problem.
- (1996). A fast taboo search algorithm for the job shop problem.
- (1996). A fast tabu search algorithm for the permutation ﬂow-shop problem.
- (1999). A fully polynomial approximation scheme for weighted earliness-tardiness problem.
- (1969). A functional equation and its application to resource allocation and sequencing problems.
- (1978). A general bounding scheme for the permutation ﬂow-shop problem.
- (1992). A genetic algorithm applicable to large-scale job-shop problems. In:
- (1995). A genetic algorithm for ﬂowshop sequencing.
- (1991). A genetic algorithm for job shop. In:
- (1995). A genetic algorithm for the job shop problem.
- (2002). A linear time approximation scheme for makespan minimization in an open shop with release dates.
- (1958). A method for solving traveling salesman problems.
- (1970). A method of solution for general machine scheduling problems.
- (1994). A new adaptive multi-start technique for combinatorial global optimizations.
- (1996). A new heuristic for three-machine ﬂow shop scheduling.
- (1989). A new heuristic method for the ﬂow shop sequencing problem.
- (1984). A new polynomial-time algorithm for linear programming. In:
- (1955). A non-numerical approach to production scheduling problems.
- (1979). A polynomial algorithm in linear programming.
- (1988). A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximating approach.
- (1988). A polynomial-time algorithm for an approximate solution of a scheduling problem (in Russian).
- (1968). A proof of the shortest remaining processing time processing discipline. Opns Res 16: 687–690. Schrage L (1970A). Solving resource-constrained network problems by implicit enumeration – nonpremptive case.
- (1967). A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three scheduling problems.
- (1970). A simple optimality proof of Moore’s sequencing algorithm.
- (1994). A simulated annealing approach to job shop scheduling using critical block transition operators. In:
- (2002). A survey of very large-scale neighborhood search techniques.
- (1982). Algorithms for edge coloring bipartite graphs and multigraphs.
- (1976). Algorithms for scheduling independent tasks.
- (1980). An adaptive branching rule for the permutation ﬂow-shop problem.
- (1965). An algorithm for ﬁnding optimal or near optimal solutions to the production scheduling problem.
- (1983). An algorithm for single machine sequencing with deadlines to minimize total weighted completion time.
- (1983). An algorithm for single machine sequencing with release dates to minimize total weighted completion time.
- (1982). An algorithm for solving the job-shop problem.
- (1960). An automatic method of solving discrete programming problems.
- (1956). An extension of Johnson’s result on job lot scheduling.
- (2004). An FPTAS for scheduling a two-machine ﬂowshop with one unavailability interval.
- (2008). An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times.
- (1971). An improved combinatorial algorithm for the ﬂowshop-scheduling problem,
- (1971). An improved method for scheduling independent tasks.
- (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem.
- (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs.
- (1985). Analysis of a linear programming heuristic for scheduling unrelated parallel machines.
- (1998). and Vazacopoulos A
- (1965). Application of the branch-and-bound technique to some ﬂow-shop scheduling problems.
- (1993). Applying tabu-search to the job-shop scheduling problem.
- (1998). Approximability of ﬂow shop scheduling.
- (1990). Approximation algorithms for scheduling unrelated parallel machines.
- (1993). Approximation algorithms for three-machine open shop scheduling.
- (1998). Approximation algorithms for two-machine ﬂow shop scheduling with batch setup times.
- (2009). Approximation results for ﬂow shop scheduling problems with machine availability constraints.
- (1999). Approximation schemes for minimizing average weighted completion time with release dates. In:
- (1966). Bounds for certain multiprocessing anomalies.
- (1969). Bounds on multiprocessing timing anomalies.
- (1977). Complexity of machine scheduling problems.
- (2005). Complexity of preemptive minsum scheduling on unrelated parallel machines.
- (1978). Complexity of scheduling under precedence constraints.
- (1978). Complexity of task sequencing with deadlines, set-up times and changeover costs.
- (1982). Computer aided complexity classiﬁcation of combinatorial problems.
- (1965). Computer solutions of the traveling salesman problem.
- (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman:
- (2001). Convex quadratic and semideﬁnite programming relaxations in scheduling.
- (1974). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part I, Theory.
- (1975). Coordinating aggregate and detailed scheduling decisions in the one-machine job shop: Part II, Computation and structure.
- (1964). Das Reinenfolgeproblem in der Fertigungsprogrammierung und Linearplanung mit logischen Bedingungen.
- (1991). Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date.
- (1991). Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date.
- (1960). Ein Beitrag zum Reihenfolge problem.
- (1971). Elimination methods in the m × n sequencing problem.
- (1995). Evolution based learning in a job shop scheduling environment.
- (1976). Exact and approximate algorithms for scheduling nonidentical processors.
- (1992). Experiment of using genetic algorithms to learn scheduling heuristics.
- (1975). Fast approximation algorithms for the knapsack and sum of subset problems.
- (1978). Flow shop and job shop schedules: complexity and approximation.
- (1967). Flow-shop scheduling with the branch-and-bound method,
- (1986). Future paths for integer programming and links to artiﬁcial intelligence.
- (1989). Graph-theoretical models for preemptive scheduling. In:
- (2000). Group technology approach to the open shop scheduling problem with batch setup times.
- (2007). Hybrid metaheuristics to aid runway scheduling at London Heathrow airport.
- (1996). Improving local search heuristics for some scheduling problems—I.
- (1997). Improving local search heuristics for some scheduling problems. Part II.
- (1963). Industrial Scheduling.
- (1976). Integer programming approaches to the travelling salesman problem.
- (2009). Integrated production and outbound distribution scheduling: review and extensions. Opns Res,
- (1992). Integrating scheduling with batching and lotsizing: a review of algorithms and complexity.
- (1974). Introduction to Sequencing and Scheduling,
- (1985). Job shop scheduling with genetic algorithms. In:
- (1999). Landscapes, operators and heuristic search.
- (1964). Les problem` es d’ordonnancement avec contraintes disjonctives.
- (1998). Local search heuristics for the single machine total weighted tardiness scheduling problem.
- (2001). Machine scheduling with a rate-modifying activity.
- (1998). Machine scheduling with availability constraints.
- (2004). Machine scheduling with availability constraints. In: Leung J Y-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapman & Hall/CRC: Boca Raton, FL,
- (2001). Machine scheduling with transportation considerations.
- (1998). Makespan minimization in open shops: a polynomial time approximation scheme.
- (1975). Minimizing total costs in onemachine scheduling.
- (1990). Minimizing total tardiness on one processor is NP-hard.
- (1982). Nearly optimum solution of multi-machine scheduling problems (in Hungarian).
- (1994). New lower and upper bounds for scheduling around a small common due date.
- (1992). New search spaces for sequencing problems with application to job shop scheduling.
- (2001). Non-approximability results for scheduling problems with minsum criteria.
- (1991). Old stories. In: Lenstra JK, Rinnooy Kan AHG and Schrijver A (eds). History of Mathematical Programming. A Collection of Personal Reminiscences. CWI and North-Holland: Amsterdam,
- (1978). On preemptive scheduling of unrelated parallel processors by linear programming.
- (1964). On scheduling problems with deferral costs.
- (1975). On scheduling with ready times and due dates to minimize maximum lateness.
- (1973). On sequencing with earliest start and due dates with application to computing bounds for the (n|m|G|Fmax) problem.
- (1970). On some combinatorial problems arising in scheduling.
- (1994). On some geometric methods in scheduling theory: a survey.
- (1968). On some sequencing problems.
- (1967). On the bound of makespans and its application in M machine scheduling problem.
- (1989). On the complexity of scheduling with batch setup times.
- (1972). On the N-job, one-machine, sequence-independent scheduling problem with tardiness penalties: A branch-bound solution.
- (1980). On the symmetric travelling salesman problem: a computational study.
- (1980). On the symmetric travelling salesman problem: solution of a 120-city problem.
- (1969). One-machine sequencing to minimize certain functions of job tardiness.
- (2004). Online scheduling of a single machine to minimize total weighted completion time.
- (2004). Online scheduling. In: Leung JY-T (ed). Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapman & Hall/CRC: Boca Raton, FL,
- (1976). Open shop scheduling to minimize ﬁnish time.
- (1973). Optimal elimination methods in the m × n sequencing problem.
- (1996). Optimal online algorithms for single-machine scheduling. In:
- (1969). Optimal production schedules for ﬂow shops,
- (1954). Optimal two- and three-stage production schedules with setup times included.
- (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey.
- (1983). Optimization by simulated annealing,
- (1999). Parallel machine scheduling by column generation.
- (1994). Parallel taboo search techniques for the job shop scheduling problem
- (1965). Paths, trees, and ﬂowers.
- (2001). Performance guarantees of local search for multiprocessor scheduling. In:
- (2006). Planning machine maintenance in two-machine shop scheduling.
- (1999). Polynomial time approximation algorithms for machine scheduling: Ten open problems.
- (1986). Preemptive scheduling of uniform machines by ordinary network ﬂow techniques.
- (1984). Preemptive scheduling of uniform machines subject to release dates. In:
- (1982). Preemptive scheduling with release times, deadlines and due times.
- (1982). Recent developments in deterministic sequencing and scheduling: A survey. In:
- (1972). Reducibility among combinatorial problems. In:
- (1998). Scheduling a batching machine.
- (1955). Scheduling a production line to minimize maximum tardiness.
- (2001). Scheduling aircraft landings at London Heathrow using a population heuristic.
- (1995). Scheduling Algorithms.
- (1991). Scheduling around a small common due date.
- (2001). Scheduling batches with simultaneous job processing for two-machine shop problems.
- (2000). Scheduling groups of jobs in two-machine open shop.
- (1993). Scheduling in Computer and Manufacturing Systems.
- (1966). Scheduling independent tasks on independent processors.
- (1974). Scheduling independent tasks to reduce mean ﬁnishing time.
- (2000). Scheduling jobs and maintenance activities on parallel machines.
- (1982). Scheduling open shops with parallel machines.
- (1997). Scheduling semiconductor burn-in operations to minimize total ﬂowtime.
- (1989). Scheduling Theory. Multi-Stage System (in Russian). Nauka: Moscow; English translation by Kluwer:
- (1984). Scheduling Theory. Single-Stage Systems (in Russian). Nauka: Moscow; English translation by Kluwer:
- (1997). scheduling to minimize average completion time: oﬀ-line and on-line approximation algorithms.
- (1996). Scheduling with an availability constraint.
- (2000). Scheduling with batching: A review.
- (1959). Scheduling with deadlines and loss functions.
- (1993). Scheduling with delivery and earliness penalties.
- (2000). Scheduling with limited machine availability.
- (1995). Scheduling: Theory, Algorithms, and Systems.
- (1964). Sequencing a one–state variable machine: a solvable case of the traveling salesman problem.
- (1993). Sequencing and scheduling: Algorithms and complexity. In:
- (1997). Sequencing and scheduling. In:
- (1978). Sequencing jobs to minimize total weighted completion time subject to precedence constraints.
- (1990). Sequencing with earliness and tardiness penalties: a review.
- (1979). Sequencing with series-parallel precedence constraints.
- (1997). Short shop schedules.
- (1989). Simulated annealing for permutation ﬂow-shop scheduling.
- (1991). Single machine scheduling polyhedra with precedence constraints.
- (1991). Single machine tardiness sequencing heuristics.
- (1980). Solving large-scale symmetric travelling salesman problems to optimality.
- (1999). Solving parallel machine scheduling problems by column generation.
- (1993). Solving the job shop scheduling problem with tabu search.
- (1990). Some eﬃcient heuristic methods for the ﬂow shop sequencing problem.
- (1974). Some simple scheduling algorithms.
- (1979). Special Purpose Algorithms for One-Machine Sequencing Problems with Single and Composite Objectives.
- (1982). Stochastic shop scheduling: A survey. In:
- (1993). Supply chain scheduling: Batching and delivery.
- (2007). Supply chain scheduling: Conﬂict and cooperation in assembly systems.
- (1989). Tabu search: Part I.
- (1990). Tabu search: Part II.
- (1990). The application of the simulated annealing algorithm to the solution of the n|m|Cmax ﬂowshop problem.
- (1976). The complexity of ﬂowshop and jobshop scheduling.
- (1971). The complexity of theorem–proving procedures. In:
- (1974). The Job-Machine Scheduling Problem.
- (1998). The mystical power of twoness: in memoriam
- (1968). The one-machine sequencing problem with delay costs.
- (1982). The one-machine sequencing problem.
- (1961). The order of n items processed on m machines:
- (1988). The shifting bottleneck procedure for job shop scheduling.
- (1971). The traveling-salesman problem and minimum spanning trees: Part II.
- (1967). Theory of Scheduling.
- (1985). Thermodynamical approach to the traveling salesman problem: An eﬃcient simulation algorithm.
- (1993). Two–machine shop scheduling problems with batch processing.
- (1978). Using cutting planes to solve the symmetric travelling salesman problem.
- (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results.
- (1974). Validation of subgradient optimization.
- (1956). Various optimizers for single-stage production.
- (1995). Vector summation in Banach space and polynomial time algorithms for ﬂow shops and open shops.
- (1916). Work, Wages, and Proﬁts, 2nd edition. Engineering Magazine Co: New York. Reprinted by Hive Publishing Company:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.