A prediction based iterative decomposition algorithm for scheduling large-scale job shops

Mathematical and Computer Modelling

Volumn 47, Issue 3-4, 2008, Pages 411-421

  Liu, Min ^a   Hao, Jing Hua ^a   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Decomposition; Job shop; Large scale; Prediction; Scheduling

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; GENETIC ALGORITHMS; ITERATIVE METHODS; MATHEMATICAL MODELS; PREDICTIVE CONTROL SYSTEMS; PROBLEM SOLVING;

GLOBAL SCHEDULING; GLOBAL SCHEDULING CHARACTERISTICS PREDICTION MODEL (GSCPM); ITERATIVE DECOMPOSITION ALGORITHM;

SCHEDULING ALGORITHMS;

EID: 38149118014     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2007.03.032     Document Type: Article

References (29)

1. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley, New York
2. Lenstra J.K., Rinnooy K.A., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
3. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco, CA
4. Akers S.B. A graphical approach to production scheduling problems. Operations Research 4 2 (1956) 244-245
5. Jackson J.R. An extension of Johnson's result on job lot scheduling. Naval Research Logistics Quarterly 3 3 (1956) 201-203
6. Carlier J., and Pinson E. An algorithm for solving the job-shop problem. Management Science 35 2 (1989) 164-176
7. Barker J.R., and McMahon G.B. Scheduling the general job-shop. Management Science 31 5 (1985) 594-598
8. Wagner H.M. An integer programming model for machine scheduling. Naval Research Logistics Quarterly 6 (1959) 131-140
9. Panwalker S.S., and Iskander W.A. A survey of scheduling rules. Operations Research 25 1 (1977) 45-61
10. Vepsalainen A.P.J., and Morton T.E. Priority rules for job shops with total weighted tardiness costs. Management Science 33 8 (1987) 1035-1047
11. Cheng R., and Gen M. A tutorial survey of job-shop scheduling problems using genetic algorithms part I: Representation. Computers & Industrial Engineering 34 4 (1996) 983-997
12. Davis L. Job-shop scheduling with genetic algorithm. In: Grefenstette J.J. (Ed). Proceedings of the 1st International Conference on Genetic Algorithms and their Applications (1985), Lawrence Erlbaum, Pittsburgh, PA, USA 136-140
13. Della Croce F., Tadei R., and Volta G. A genetic algorithm for the job shop problem. Computers & Operations Research 22 1 (1995) 15-24
14. Barnes J.W., and Chambers J.B. Solving the job shop scheduling problem with tabu search. IIE Transactions 27 22 (1995) 257-263
15. Dell'Amico M., and Trubian M. Applying Tabu search to the job-shop scheduling problem. Annals of Operations Research 41 (1993) 231-252
16. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job-shop problem. Management Science 42 6 (1996) 797-813
17. Van Laarhoven P., Aarts E., and Lenstra J. Job shop scheduling by simulated annealing. Operations Research 40 1 (1992) 113-125
18. Yamada T., and Nakano R. Job-shop scheduling by simulated annealing combined with deterministic local search. Meta-heuristics: Theory and Applications (1996), Kluwer Academic Publishers, MA, USA 237-248
19. H. Matsuo, C.J. Suh, R.S. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Working Paper, 1988, 03-04-88, Graduate School of Business, University of Texas at Austin, Austin, TX, USA
20. Chu C., Portman M.C., and Proth J.M. A splitting-up approach to simplify job shop scheduling problem. International Journal of Production Research 30 4 (1992) 859-870
21. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
22. Peter B.L., and Debra J.H. Scheduling of manufacturing systems using the lagrangian relaxation technique. IEEE Transactions on Automatic Control 38 7 (1993) 1066-1080
23. Sun D., and Batta R. Scheduling large job shops: A decomposition approach. International Journal of Production Research 34 7 (1996) 2019-2033
24. Eui-Seok B., Wu S.D., and Robert H.S. Decomposition heuristics for robust job-shop scheduling. IEEE Transactions on Robotics and Automation 14 2 (1998) 303-313
25. Jeffrey D.K., and John L. Mann flowsheet decomposition heuristic for scheduling: A relax-and-fix method. Computers and Chemical Engineering 28 11 (2004) 2193-2200
26. Anis G.B., and Mohamed H. An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Computers & Operations Research 34 3 (2007) 868-883
27. Macros S. Decomposition methods for large job shops. Computers & Operations Research 28 3 (2001) 193-207
28. Liu M., and Wu C. Genetic algorithm using sequence rule chain for multi-objective optimization in re-entrant micro-electronic production line. Robotics and Computer-Integrated Manufacturing 20 3 (2004) 225-236
29. D.E. Goldberg, R. Lingle, Alleles, loci and the traveling salesman problem, in: Proceedings of the International Conference on Genetic Algorithms and their Applications, Lawrence Erlbaum Associates, 1985, pp. 154-159