Multi-bottleneck scheduling algorithm for large-scale Job Shop

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 17, Issue 7, 2011, Pages 1486-1494

  Zhai, Ying Ni ^a   Sun, Shu Dong ^a   Yang, Hong An ^a   Niu, Gang Gang ^a   Yuan, Zong Yin ^a  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

Author keywords

Critical path; Job Shop; Multi bottleneck; Rolling horizon; Scheduling algorithm

Indexed keywords

BOTTLENECK MACHINES; BOTTLENECK OPERATIONS; CONSTRUCTION PROCESS; CRITICAL PATH METHOD; CRITICAL PATHS; DISPATCHING RULES; GLOBAL SOLUTIONS; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; LOAD-BALANCED; MULTI-BOTTLENECK; OVERLAPPING OPERATIONS; ROLLING HORIZON; SIMULATION RESULT; SOLUTION PROCESS; SOLUTION QUALITY; SUB-PROBLEMS; THEORY OF CONSTRAINT;

TURNAROUND TIME;

SCHEDULING ALGORITHMS;

EID: 80051553873     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. PINEDO M L. Scheduling: theory, algorithms, and systems[M]. Upper Saddle River, N.J., USA: Prentice Hall, 2008.
2. JIN Feng, WU Cheng. Research status and prospects for massive production scheduling[J]. Computer Integrated Manufacturing Systems, 2006, 12(2): 161-168(in Chinese).
3. LIANG Xu, WANG Jia, HUANG Ming. New coding method for massive production scheduling problem[J]. Computer Integrated Manufacturing Systems, 2008, 10(14): 1974-1982(in Chinese).
4. CHEN H, LUH P B. An alternative framework to lagrangian relaxation approach for Job Shop scheduling[J]. European Journal of Operational Research, 2003, 149(3): 499-512.
5. HAOXUN C, CHENGBIN C, PROTH J M. An improvement of the lagrangean relaxation approach for Job Shop scheduling: a dynamic programming method[J]. IEEE Transactions on Robotics and Automation, 1998, 14(5): 786-795.
6. MNCH L, SCHABACKER R, PABST D, et al. Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex Job Shops[J]. European Journal of Operational Research, 2007, 177(3): 2100-2118.
7. ZUO Y, GU H, XI Y. Study on constraint scheduling algorithm for job shop problems with multiple constraint machines[J]. International Journal of Production Research, 2008, 46(17): 4785-4801.
8. BASSETT M H, PEKNY J F, REKLAITIS G V. Decomposition techniques for the solution of large-scale scheduling problems[J]. AIChE Journal, 1996, 42(12): 3373-3387.
9. SOURIRAJAN K, UZSOY R. Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication[J]. Journal of Scheduling, 2007, 10(1): 41-65.
10. ZHANG C Y, LI P, RAO Y, et al. A very fast TS/SA algorithm for the Job Shop scheduling problem[J]. Computers & Operations Research, 2008, 35(1): 282-294.
11. WU S D, BYEON E S, STORER R H. A graph-theoretic decomposition of the Job Shop scheduling problem to achieve scheduling robustness[J]. Operations Research, 1999, 47(1): 113-124.
12. WATSON K J, BLACKSTONE J H, GARDINER S C. The evolution of a management philosophy: the theory of constraints[J]. Journal of Operations Management, 2007, 25(2): 387-402.
13. ZHAI Yingni, SUN Shudong, WANG Junqiang, et al. Study on bottleneck detection method based on orthogonal experiment for Job Shop[J]. Computer Integrated Manufacturing Systems, 2010, 16(9): 1945-1952(in Chinese).
14. HAUPT R. A survey of priority rule-based scheduling[J]. OR Spektrum, 1989, 11(1): 3-16.
15. ZHANG Rui, WU Cheng. Decomposition-based optimization algorithm for large-scale Job Shop scheduling problems[J]. Computer Integrated Manufacturing Systems, 2008, 18(8): 1559-1565(in Chinese).
16. WANG Ling. Shop scheduling with genetic algorithms[M]. Beijing: Tsinghua University Press, 2003(in Chinese).
17. FENG X, LEUNG H, TANG L. An effective algorithm based on genet neural network model for Job Shop scheduling with release dates and due dates[M]. Berlin, Germany: Springer-Verlag, 2005.