The Challenge of Sequence-Dependent Setups: Proposal for a Scheduling Competition Track on One Machine Sequencing Problems

Designing a scheduling competition to attract researchers from the several fields interested in scheduling problems seems a challenging, and highly worthwhile effort. In this paper, we propose a design for one possible track of this proposed scheduling competition. Specifically, we propose a track aimed at one machine sequencing problems. We argue that any such track must include problems with sequencedependent setups. Our proposed single machine sequencing track would additionally include a spectrum of objective functions of increasing optimization difficulty under sequence-dependent setups. We also offer a problem instance generator along with a set of benchmark problem instances for one potential competition problem—the weighted tardiness scheduling problem with sequence-dependent setups.

[1]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[2]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[3]  Thomas E. Morton,et al.  Myopic Heuristics for the Single Machine Weighted Tardiness Problem , 1982 .

[4]  Mark S. Fox,et al.  Factory Model and Test Data Descriptions: OPIS Experiments , 1990 .

[5]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

[6]  Vincent A. Cicirello,et al.  Non-wrapping order crossover: an order preserving crossover operator that respects absolute position , 2006, GECCO.

[7]  Ram Rachamadugu,et al.  Real-time scheduling of an automated manufacturing center * , 1989 .

[8]  Stephen F. Smith,et al.  Boosting stochastic problem solvers through online self-analysis of performance , 2003 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[11]  Michael Pinedo,et al.  A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .

[12]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[13]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[14]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[15]  Stephen F. Smith,et al.  Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics , 2005, J. Heuristics.

[16]  Amitava Bagchi,et al.  Graph Search Methods for Non-Order-Preserving Evaluation Functions: Applications to Job Sequencing Problems , 1996, Artif. Intell..

[17]  Vincent A. Cicirello,et al.  On the Design of an Adaptive Simulated Annealing Algorithm , 2007 .

[18]  C. Klein,et al.  Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness , 1999 .

[19]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .