论文信息 - Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Library

Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Library

This report details a set of benchmark problem instances that we have generated for the weighted tardiness scheduling with sequence-dependent setups problem. The version of the problem without setup times is NP-Hard. The problem is further complicated by the sequence-dependent nature of the setups. Given that the weighted tardiness objective and the sequence-dependent setups constraint are both common real-world problem characteristics, and given the difficulty in solving this problem, we feel that it is currently under-represented in the research literature. With few algorithms currently available for the problem, this first benchmark problem set and initial results obtained via a large number of heuristic algorithms will hopefully encourage others to explore additional solutions to the problem.

Vincent A. Cicirello | V. Cicirello

[1] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[2] Stephen F. Smith,et al. Randomizing Dispatch Scheduling Policies , 2001 .

[3] P. Langley. Systematic and nonsystematic search strategies , 1992 .

[4] Richard E. Korf,et al. Improved Limited Discrepancy Search , 1996, AAAI/IAAI, Vol. 1.

[5] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.

[6] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

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

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

[9] Stephen F. Smith,et al. Amplification of Search Performance through Randomization of Heuristics , 2002, CP.

[10] John L. Bresina,et al. Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[11] Toby Walsh. Depth-bounded Discrepancy Search , 1997, IJCAI.