An efficient search method for job-shop scheduling problems

IEEE Transactions on Automation Science and Engineering

Volumn 2, Issue 1, 2005, Pages 73-77

  Shi, Leyuan ^a   Pan, Yunpeng ^a  

^a Wisconsin Electric Machines and Power Electronics Consortium   (United States)

Author keywords

Local search; Scheduling; Tabu search (TS)

Indexed keywords

ALGORITHMS; BENCHMARKING; ELECTRONIC COMMERCE; INFORMATION SCIENCE; PROBLEM SOLVING; SET THEORY; VISION;

AUTOMATED SYSTEMS; FLOOR TRACKING SYSTEMS; LOCAL SEARCH; TABU SEARCH (TS);

SCHEDULING;

EID: 12844288684     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2004.829418     Document Type: Article

References (25)

1. H. Fisher and G. L. Thompson, "Optical reflectometry for component characterization," in Industrial Scheduling, J. F. Muth and G. L. Thompson, Eds. Englewood Cliffs, NJ: Prentice-Hall, 1963.
2. S. Lawrence, Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. Pittsburgh, PA: GSIA, Carnegie-Mellon Univ., 1984.
3. J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure for job shop scheduling," Manag. Sci., vol. 32, pp. 391-401, 1988.
4. E. Balas, J. K. Lenstra, and A. Vazacopoulos, "The one-machine problem with delayed precedence constraints and its use in job shop scheduling," Manag. Sci., vol. 41, pp. 94-109, 1995.
5. R. J. M. Vaessens, E. H. L. Aarts, and J. K. Lenstra, "Job shop scheduling by local search," INFORMS J. Comput., vol. 8, pp. 302-317, 1996.
6. H. Matsuo, C. J. Suh, and R. S. Sullivan, A Controlled Search Simulated Annealing Method for the General Job-Shop Scheduling Problem. Austin, TX: Grad. School of Bus., Univ. of Texas, 1988.
7. P. J. M. van Laarhoven, E. H. L. Aarts, and J. K. Lenstra, "Job shop scheduling by simulated annealing," Oper. Res., vol. 40, pp. 113-125, 1992.
8. E. H. L. Aarts, P. van Laarhoven, J. K. Lenstra, and N. L. J. Ulder, "A computational study of local search algorithms for job shop scheduling," ORSA J. Comput., vol. 6, pp. 118-125, 1994.
9. M. Dell'Amico and M. Trubian, "Applying tabu search to the job-shop scheduling problem," Ann. Oper. Res., vol. 41, pp. 231-252, 1993.
10. E. Taillard, "Parallel taboo search techniques for the job-shop scheduling problem," ORSA J. Comput., vol. 16, pp. 108-117, 1994.
11. J. W. Barnes and J. B. Chambers, "Solving the job shop scheduling problem using tabu search," IIE Trans., vol. 27, pp. 257-263, 1995.
12. E. Nowicki and C. Smutnicki, "A fast tabu search algorithm for job shop problem," Manag. Sci., vol. 42, pp. 797-813, 1996.
13. T. Yamada and R. Nakano, "A genetic algorithm applicable to large-scale job-shop problems," in Proc. 2nd Int. Workshop on Parallel Problem Solving from Nature, R. Männer and B. Manderick, Eds., Brussels, Belgium, pp. 281-290.
14. F. Della Croce, R. Tadei, and G. Volta, "A genetic algorithm for the job shop problem," Comp. Oper. Res., vol. 22, pp. 15-24, 1995.
15. U. Dorndorf and E. Pesch, "Evolution based learning in a job-shop scheduling environment," Comp. Oper. Res., vol. 22, pp. 25-40, 1995.
16. E. Balas and A. Vazacopoulos, "Guided local search with shifting bottleneck for job-shop scheduling," Manag. Sci., vol. 44, pp. 262-275, 1998.
17. E. Balas, "Disjunctive programming," Ann. Discrete Math., vol. 5, pp. 3-51, 1979.
18. B. Roy and B. Sussmann, Les problèmes d'ordonnancements avec contraintes disjonctives. Paris, France: SEMA, 1964.
19. F. Glove and M. Laguna, Tabu Search. Norwell, MA: Kluwer, 1997.
20. A. S. Jain, B. Rangaswamy, and S. Meeran, "New and 'stronger' job shop neighborhoods: A focus on the method of Nowicki and Smutnicki," J. Heur., vol. 6, pp. 457-480, 2000.
21. Y. L. Chang, T. Sueyoshi, and R. S. Sullivan, "Ranking dispatching rules by data envelopment analysis in a job-shop environment," IIE Trans., vol. 28, pp. 631-642, 1996.
22. A. S. Jain and S. Meeran, "Deterministic job-shop scheduling: Past, present, and future," Eur. J. Oper. Res., vol. 113, pp. 390-434, 1999.
23. É. Taillard. (2002) Job shop test problems. [Online]. Available: http://www.eivd.ch/ina/collaborateurs/etd/problemes.dir/ordonnancement.dir/ best_1b_up.txt
24. W. Brinkkötter and P. Brucker, "Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments," J. Sched., vol. 4, pp. 53-64, 2001.
25. L. Shi and Y. Pan. Detailed computational results for "An efficient search method for job-shop scheduling problems". [Online]. Available: http://www.cae.wisc.edu/pany/enhanced_tabu/table.pdf