Research status and prospects for massive production scheduling

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 12, Issue 2, 2006, Pages 161-168

  Jin, Feng ^a   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Intelligent optimization algorithms; Lagrangian relaxation decomposition; Massive production scheduling; Problem decomposition

Indexed keywords

DECOMPOSITION; GENETIC ALGORITHMS; NEURAL NETWORKS; OPTIMIZATION; PARALLEL ALGORITHMS; PETRI NETS; POLYNOMIALS; PRODUCTION;

FLOW SHOP; INTELLIGENT OPTIMIZATION ALGORITHMS; LAGRANGIAN DECOMPOSITION; LAGRANGIAN RELAXATION; MASSIVE PRODUCTION SCHEDULING; NONDETERMINISTIC POLYNOMIAL (NP); PROBLEM DECOMPOSITION; RELEASE DATA;

SCHEDULING;

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

References (54)

1. JOHNSON S M. Optimal two-and three-stage production schedules with setup times included[J]. Naval Research Logistics Quarterly, 1954, 1(1): 61-68.
2. LENSTRA J K, RINNOY K A H G, BRUCKER P. Complexity of machine scheduling problems[A]. Studies in Integer Programming[J]. New York, NY, USA: North-Holland Publishing Company, 1977. 343-362.
3. WANG Ling. Shop scheduling with genetic algorithms[M]. Beijing: Tsinghua University Press, 2003 (in Chinese).
4. BITRAN G R, HAAS E A, HAX A C. Hierarchical production planning: a single stage system[J]. Operations Research, 1981, 29(4): 717-743.
5. BASSETT M H, DAVE P, DOYLE III F J, et al. Perspectives on model based integration of process operations[J]. Computer and Chemical Engineering, 1996, 20(6-7): 821-844.
6. BASSETT M H, JOSEPH F P, GINTARAS V R. Decomposition techniques for the solution of large-scale scheduling problems[J]. AIChE Journal, 1996, 42(12): 3373-3387.
7. WU D, IERAPETRITOU M G. Decomposition approaches for the efficient solution of short-term scheduling problems[J]. Computers and Chemical Engineering, 2003, 27(8-9): 1261-1276.
8. CHU C, PORTMANN M C, PROTH J M. A splitting-up approach to simplify job-shop scheduling problems[J]. International Journal of Production Research, 1992, 30(4): 859-70.
9. SUN D, BATTA R. Scheduling larger job shops: a decomposition approach[J]. International Journal of Production Research, 1996, 34(7): 2019-2033.
10. SANNOMIYA N, IIMA H. Genetic algorithm approach to an optimal scheduling problem for a large-scale complex manufacturing system[A]. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics[C]. NJ, USA: IEEE, 1999, 3: III-622-III-627.
11. ROSLÖF J, HARJUNKOSKI I, WESTERLUND T, et al. A short-term scheduling problem in the paper-converting industry[J]. Computers and Chemical Engineering, 1999, 23(12): S861-S864.
12. ROSLOF J, HARJUNKOSKI I, WESTERLUND T, et al. Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure[J]. European Journal of Operational Research, 2002, 138(1): 29-42.
13. WERNER F, WINKLER A. Insertion techniques for the heuristic solution of the job shop problem[J]. Discrete Applied Mathematics, 1995, 58(2): 191-211.
14. KIM Y, WOO K, IUABA A, et al. FMS scheduling based on timed Petri net model and RTA* algorithm[A]. Proceedings of 2001 IEEE International Conference on Robotics and Automation (ICRA)[C]. NJ, USA, IEEE, 2001. 848-853.
15. KIM Y, IUABA A, SUZUKI T, et al. Hierarchical scheduling for large-scale production system based on continuous and timed Petri net model[A]. Proceedings of the 41st SICE Annual Conference[C]. Tokyo, Japan: The Society of Instrument and Control Engineers (SICE), 2002. 268-271.
16. FISHER M L. The lagrangian relaxation method for solving integer programming problems[J]. Management Science, 1981, 27(1): 1-18.
17. FISHER M L. An applications oriented guide to lagrangian relaxation[J]. Interfaces, 1985, 15(2): 10-21.
18. GUIGNARD M, KIM S. Lagrangian decomposition: a model yielding stronger Lagrangian bounds[J]. Mathematical Programming, 1987, 39(2): 215-228.
19. WU Qinglie, XU Nanrong. A decomposition method for solving the integer large-scale optimization problem[J]. Journal of Southeast University, 1996, 26(3): 119-125 (in Chinese).
20. WANG J, LUH P B, ZHAO X, et al. An optimization-based algorithm for job shop scheduling[J]. Sadhana-Academy Proceedings in Engineering Sciences, 1997, 22(2): 241-256.
21. TANG L X, LUH P B, LIU J Y, et al. Steel-making process scheduling using Lagrangian relaxation[J]. International Journal of Production Research, 2002, 40(1): 55-70.
22. WANG Ling. Intelligent optimization algorithms with applications[M]. Beijing: Tsinghua University Press, 2001 (in Chinese).
23. CHENG R W, GEN M, TSUJIMURA Y. A tutorial survey of job-shop scheduling problems using genetic algorithms I - representation[J]. Computers and Industrial Engineering, 1996, 30(4): 983-997.
24. CHENG R W, GEN M, TSUJIMURA Y. A tutorial survey of job-shop scheduling problems using genetic algorithms II-hybrid genetic search strategies[J]. Computers and Industrial Engineering, 1999, 36(2): 343-364.
25. MATTFELD D, BIERWIRTH C. An efficient genetic algorithm for job shop scheduling with tardiness objectives[J]. European Journal of Operational Research, 2004, 155(2): 616-630.
26. PONNAMBALAM S G, RAMKUMAR V, JAWAHAR N. A multiobjective genetic algorithm for job shop scheduling[J]. Production Planning and Control, 2001, 12(8): 764-774.
27. SARAVANA S S, PONNANBALAM S G, RAJENDRAN C. A multiobjective genetic algorithm for scheduling a flexible manufacturing system[J]. The International Journal of Advanced Manufacturing Technology, 2003, 22(3-4): 229-236.
28. DEB K, REDDY A. Large-scale scheduling of casting sequences using a customized genetic algorithm[A]. Artificial Evolution Lecture Notes in Computer Science[C]. Berlin, Germany: Springer, 2004. 141-152.
29. FOO S Y, TAKEFUJI Y. Stochastic neural networks for solving job-shop scheduling: Part I. problem representation[A]. Proceedings of IEEE IJCNN[C]. San Diego, CA, USA, IEEE, 1988. 275-282.
30. FOO S Y, TAKEFUJI Y. Stochastic neural networks for solving job-shop scheduling: Part II. architecture and simulations[A]. Proceedings of IEEE IJCNN[C]. San Diego, CA, USA: IEEE, 1988. 283-290.
31. FOO S Y, TAKEFUJI Y. Integer linear programming neural network for job-shop scheduling[A]. Proceedings of IEEE IJCNN[C]. San Diego, CA, USA: IEEE, 1988. 341-348.
32. ZHOU D N, CHERKASSKY V, BALDWIN T R, et al. Scaling neural network for job-shop scheduling[A]. International Joint Conference on Neural Networks[C]. NJ, USA: IEEE, 1990.889-894.
33. HOU Z G. A hierarchical optimization neural network for large-scale dynamic systems[J]. Automatica, 2001, 37(12): 1931-1940.
34. SABUNCUOLU I, GURGUN B. A neural network model for scheduling problems[J]. European Journal of Operational Research, 1996, 93(2): 288-299.
35. YANG S X, WANG D W. A new adaptive neural network and heuristics hybrid approach for job-shop scheduling[J]. Computers and Operations Research, 2001, 28(10): 955-971.
36. YU H B, LIANG W. Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling[J]. Computers and Industrial Engineering, 2001, 39(3-4): 337-356.
37. LAARHOVEN van P J M, AARTS E H L, LENSTRA J K. Job shop scheduling by simulated annealing[J]. Operations Research, 1992, 40(1): 113-125.
38. KRISHNA K, GANESHAN K, JANAKI R D. Distributed simulated annealing algorithms for job shop scheduling[J]. IEEE Transactions on Systems Man and Cybernetics, 1995, 25(7): 1102-1109.
39. PONNAMBALAM S G, JAWAHAR N, ARAVINDAN P. A simulated annealing algorithm for job shop scheduling[J]. Production Planning and Control, 1999, 10(8): 767-777.
40. NAJID N M, DAUZERE-PERES S, ZAIDAT A. A modified simulated annealing method for flexible job shop scheduling problem[A]. Proceedings of the IEEE International Conference on Systems Man and Cybernetics[C]. NJ, USA: IEEE, 2002.89-94.
41. WANG Ling, ZHENG Dazhong. Study on a class of GASA hybrid strategy and its convergence behavior[J]. Control and Decision, 1998, 13(6): 669-672(in Chinese).
42. SABUNCUOGL U I, BAYIZ M. Job shop scheduling with beam search[J]. European Journal of Operational Research, 1999, 118(2): 390-412.
43. LIU Min, SUN Yuankai, WU Cheng. Hybrid tabu search and beam search algorithm for job shop scheduling[J]. Journal of Tsinghua University, 2002, 42(3): 424-426 (in Chinese).
44. LEE S, BOK J K, PARK S. A new algorithm for large-scale scheduling problems: sequence branch algorithm[J]. Industrial and Engineering Chemistry Research, 1998, 37(10): 4049-4058.
45. SHI L Y, OLAFSSON S. Nested partitions method for global optimization[J]. Operations Research, 2000, 48(3): 390-407.
46. PRAMANICK I, KUHL J G. An inherently parallel method for heuristic problem-solving I. General framework[J]. IEEE Transactions on Parallel and Distributed Systems, 1995, 6(10): 1006-1015.
47. PRAMANICK I, KUHL J G. An inherently parallel method for heuristic problem-solving II. example applications[J]. IEEE Transactions on Parallel and Distributed Systems, 1995, 6(10): 1016-1028.
48. OHMAE H, IKKAI Y, KOMODA N, et al. A high speed scheduling method by analyzing job flexibility and taboo search for a large-scale job shop problem with group constraints[A]. Proceedings of the Emerging Technologies and Factory Automation[C]. NJ, USA: IEEE, 2003, 2: 227-232.
49. YOKOI H, KAKAZU Y, MINAGAWA M. An approach to the autonomous job-shop scheduling problem by vibrating potential method[A]. Proceedings of IEEE International Conference on Neural Networks[C]. NJ, USA: IEEE, 1994, 6: 3877-3882.
50. BAKER K R. Introduction to sequencing and scheduling[M]. New York, NY, USA; John Wiley and Sons Inc., 1974.
51. BENDERS J F. Partitioning procedures for solving mixed variables programming problems[J]. Numerische Mathematik, 1962, 4(2): 238-252.
52. ROY van T J. Cross decomposition for mixed integer programming[J]. Mathematical Programming, 1983, 25(1): 46-63.
53. SINGH M G, TITLI A. Systems: decomposition, optimization, and control[M]. New York, NY, USA: Pergamon Press, 1978.
54. LASDON L S. Optimization theory for large systems[M]. London, U. K.: Collier-Macmillan Ltd., 1970.