Scheduling algorithm based on bottleneck operations decomposition for large-scale Job Shop scheduling problems

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 17, Issue 4, 2011, Pages 826-831

  Zhai, Ying Ni ^a   Sun, Shu Dong ^a   Wang, Jun Qiang ^a   Guo, Shi Hui ^a  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

Author keywords

Bottleneck operations; Large scale job shop; Orthogonal experiment; Scheduling

Indexed keywords

BOTTLENECK MACHINES; BOTTLENECK OPERATIONS; COMPUTATION EFFICIENCY; COORDINATION TECHNIQUE; DECOMPOSITION STRATEGY; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; ORTHOGONAL EXPERIMENT; SIMULATION RESULT; SUB-PROBLEMS; THEORY OF CONSTRAINT;

COMPUTATIONAL EFFICIENCY; EXPERIMENTS; MACHINE SHOPS;

SCHEDULING ALGORITHMS;

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

References (15)

1. PINEDO M L. Scheduling: Theory, Algorithms, and Systems[M]. Berlin, Germany: Springer-Verlag, 2008.
2. ASHOUR S, HIREMATH S R. A branch-and-bound approach to the Job-Shop scheduling problem[J]. International Journal of Production Research, 1973, 11(1): 47-58.
3. HAUPT R. A survey of priority rule-based scheduling[J]. OR Spectrum, 1989, 11(1): 3-16.
4. ESWARAMURTHY V, TAMILARASI A. Hybridizing Tabu search with ant colony optimization for solving Job Shop scheduling problems[J]. The International Journal of Advanced Manufacturing Technology, 2009, 40(9): 1004-1015.
5. JIN Feng, WU Cheng. Research status and prospects for massive production scheduling[J]. Computer Integrated Manufacturing Systems, 2006, 12(2): 161-168(in Chinese).
6. 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.
7. LIU M, HAO J H, WU C. A prediction based iterative decomposition algorithm for scheduling large-scale Job Shops[J]. Mathematical and Computer Modelling, 2008, 47(3/4): 411-421.
8. WANG B, LI Q Y. Rolling horizon procedure for large-scale Job-Shop scheduling problems[C]//Proceedings of 2007 IEEE International Conference on Automation and Logistics. Washington, D. C., USA: IEEE, 2007: 829-834.
9. 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.
10. MÖNCH 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.
11. ZUO Y, GU H, XI Y. Modified bottleneck-based heuristic for large-scale Job-Shop scheduling problems with a single bottleneck[J]. Journal of Systems Engineering and Electronics, 2007, 18(3): 556-565.
12. ZHANG R, WU C. Bottleneck identification procedures for the Job Shop scheduling problem with applications to genetic algorithms[J]. The International Journal of Advanced Manufacturing Technology, 2009, 42(11): 1153-1164.
13. GOLDRATT E M, COX J. The Goal: A Process of Ongoing Improvement[M]. Great Barrington, Mass., USA: North River Press, 1986.
14. 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).
15. LEI Yingjie. Genetic Algorithm Toolbox and Application in MATLAB[M]. Xi'an: Xidian University Press, 2005(in Chinese).