Tabu search algorithms for cyclic machine scheduling problems

Journal of Scheduling

Volumn 8, Issue 4, 2005, Pages 303-322

  Brucker, Peter ^a   Kampmeyer, Thomas ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Block approach; Cyclic scheduling; Job shop problem; Opt connectivity; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; PRODUCTION ENGINEERING; SET THEORY;

BLOCK APPROACH; CYCLIC SCHEDULING; JOB SHOP PROBLEMS; OPT CONNECTIVITY; TABU SEARCH;

SCHEDULING;

EID: 21144451714     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-005-1639-4     Document Type: Conference Paper

References (17)

1. Allan, V., R. Jones, R. Lee, and S. Allan, "Software pipelining," ACM Computing Surveys, 27(3), 367-432 (1995).
2. Beasley, J. E, "Benchmark problems," http://people.brunel.ac. uk/~mastjjb/jeb/info.html.
3. Brucker, P. Scheduling Algorithms. Springer-Verlag, Berlin, fourth edition, 2004.
4. Carlier, J. and P. Chretienne, "Les Problémes d'Ordonnancement," Technical report. Masson, Paris, 1988.
5. Cohen, G., D. Dubois, J. P. Quadrat, and M. Viot, "A linear system theretic view of discrete event process and its use for performance evaluation in manufacturing," IEEE Transactions on Automatic Control, 30(2), 210-220 (1985).
6. Dasdan, A., S. S. Irani, and R. K. Gupta. "Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems," in Proceedings of the 36th ACM/IEEE Conference on Design Automation Conference, Annual ACM IEEE Design Automation Conference, ACM Press New York, NY, USA, 1999, pp. 37-42.
7. Glover, F. "Tabu search I," ORSA Journal on Computing, 1, 190-206 (1989).
8. Glover, F. "Tabu search II," ORSA Journal on Computing, 2, 4-32 (1990).
9. Hall, N. G., T. E. Lee, and M. E. Posner, "The complexity of cyclic shop scheduling problems," Journal of Scheduling, 5(4), 307-327 (2002).
10. Hanen, C. "Study of a NP-hard cyclic scheduling problem: The recurrent job-shop," European Journal of Operational Research, 72, 82-101 (1994).
11. Hanen, C. and A. Munier, "Cyclic scheduling on parallel processors: on overview," chapter 4. In P. Chretíenne, E. G. Coffman, J. K. Lentra, and Z. Liu (eds.), Scheduling Theory and Its Applications, Wiley, New York, 1995.
12. Hanen, C. and A. Munier, "A study of the cyclic scheduling problem on parallel processors," Discrete Applied Mathematics, 57(2-3), 167-192 (1995).
13. Korst, J., "Periodic multiprocessor scheduling," PhD thesis, TU Eindhoven, 1992.
14. Lee, T. and M. Posner, "Performance measures and schedules in periodic job shop," Operations Research, 45, 72-91 (1997).
15. Rau, B. R. and J. A. Fisher, "Instruction-level parallel processing: History, overview and perspective," Journal of Supercomputing, 7, 9-50 (1993).
16. Roundy, R., "Cyclic schedules for job-shops with identical jobs," Mathematics of Operations Research, 17, 842-865 (1992).
17. Serafini, P. and W. Ukovich, "A mathematical model for periodic scheduling problems," SIAM Journal of Discrete Mathematics, 2(4), 550-581 (1986).