Scheduling manufacturing systems in an agile environment

Robotics and Computer-Integrated Manufacturing

Volumn 17, Issue 1-2, 2001, Pages 87-97

  He, David ^a   Babayan, Astghik ^a   Kusiak, Andrew ^b  

^a 1120 Science and Engineering Offices   (United States)

^b IA United States   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY; COMPUTER SIMULATION; HEURISTIC METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

AGILE MANUFACTURING SCHEDULING;

COMPUTER AIDED MANUFACTURING;

EID: 0035249160     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0736-5845(00)00041-7     Document Type: Article

References (45)

1. Kusiak A. Aggregate scheduling of a flexible machining and assembly system. IEEE Trans Robotics Automat. 5(4):1989;451-459.
2. Hunsucker J.L., Shah J.R. Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment. Eur J Oper Res. 72:1994;102-114.
3. Brah S., Hunsucker J.L. Branch and bound algorithm for the flow shop with multiple processors. Eur J Oper Res. 51:1991;88-99.
4. Brah S.A., Hunsucker J.L., Shah J.R. Mathematical modeling of scheduling problems. J Inform Optim Sci. 12:1991;113-137.
5. Gupta J.N.D. Two-stage hybrid flowshop scheduling problem. J Oper Res Soc. 34(4):1988;359-364.
6. Sriskandarajah C., Sethi S.P. Scheduling algorithms for flexible flowshop. worst and average case performance Eur J Oper Res. 43(2):1989;143-160.
7. Gupta J.N.D., Tunc E.A. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. Int J Prod Res. 29(7):1991;1489-1502.
8. Chen B. Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage. J Oper Res Soc. 46:1995;234-244.
9. Wittrock R.J. An adaptable scheduling algorithm for flexible flow lines. Oper Res. 36:1988;445-453.
10. Sawik T. A scheduling algorithm for flexible flow lines with limited intermediated buffers. Appl Stochastic Models Data Anal. 9:1993;127-138.
11. Johnson S.M. Optimal two and three-stage production schedule with setup times included. Nav Res Logistics Quart. 1(1):1954;61-68.
12. Gonzalez T., Sahni S. Flowshop and jobshop schedules. complexity and approximation Oper Res. 26(1):1978;36-52.
13. Lee C-.Y., Cheng T.C.E., Lin B.M.T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manage Sci. 39(5):1993;616-625.
14. Garey M.R., Johnson D.S. Strong NP-completeness results. motivations examples implications J Assoc Comput Math. 25:1978;499-508.
15. Cheng T.C.E., Sin C.C.S. A stage-of-the-art review of parallel-machine scheduling research. Eur J Oper Res. 47:1990;271-292.
16. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM J Appl Math. 17:1969;416-429.
17. Friesen D.K., Langston M.A. Evaluation of a multifit-based scheduling algorithm. J Algoriths. 7:1986;35-59.
18. Blazewicz J., Dror M., Weglarz J. Mathematical programming formulations for machine scheduling. a survey Eur J Oper Res. 51:1991;283-300.
19. Shaukat A.B., Hunsucker J.L. Branch and bound algorithm for the flowshop with multiple processors. Eur J Oper Res. 51:1991;88-89.
20. Santos D.L., Hunsucker J.L., Deal D.E. Global lower bounds for flow shops with multiple processors. Eur J Oper Res. 80:1995;112-120.
21. Fisher M.L., Lageweg B.J., Lenstra J.K., Rinnooy Kan A.H.G. Surrogate duality relaxation for job shop scheduling. Discrete Appl Math. 5:1983;65-75.
22. Luh P.B., Hoitomt D.J., Max E., Pattipati K.R. Schedule generation and reconfiguration for parallel machines. IEEE Trans Robotics Automat. 6(6):1990;687-696.
23. Hoitomt D.J., Luh P.B., Pattipati K.R. A practical approach to job-shop scheduling problems. IEEE Trans Robotics Automat. 9(1):1990;1-13.
24. Hoitomt D.J., Luh P.B., Max E., Pattipati K.R. Scheduling jobs with simple precedence constraints on parallel machines. IEEE Control System Manage. 10(2):1990;34-40.
25. Lenstra J.K., Rinnooy Kan A.H.G. Complexity of scheduling under precedence constraints. Oper Res. 26(1):1978;22-35.
26. Portmann M.C., Vignier A., Dardilhac D., Dezalay D. Branch and bound crossed with GA to solve hybrid flow shops. Eur J Oper Res. 107:1998;389-400.
27. Van Laarhoven P.J.M., Aarts E.H.L., Lenstra J.K. Job shop scheduling by simulated annealing. Oper Res. 40(1):1992;113-125.
28. Kolonko M. Some new results on simulated annealing applied to the job shop scheduling problem. Eur J Oper Res. 113(1):1999;123-136.
29. Nowicki E., Smutnicki C. The flow shop with parallel machines. a tabu search approach Eur J Oper Res. 106:1998;226-253.
30. Valls V., Perez A.M., Quintanilla S.M. A tabu search approach to machine scheduling. Eur J Oper Res. 106:1998;2300-2777.
31. Hopfield J.J., Tank D.W. Neural computation of decisions in optimization problems. Biol Cybernet. 52:1985;141-152.
32. Gulati S, Iyengar SS. Nonlinear networks for deterministic scheduling. Proceedings of the International Conference on Neural Networks, vol. 4, 1987. p. 745-52.
33. Arizono I., Yamamoto A., Ohto H. Scheduling for minimizing total actual flow time by neural networks. Int J Prod Res. 30:1992;503-511.
34. Vaithyanathan S., Ignizo J.P. Stochastic neural network for resource constrained scheduling. Comput Oper Res. 19:1992;241-254.
35. Johnston M.D., Adorf H.M. Scheduling with neural networks - the case of Hubble space telescope. Comput Oper Res. 19:1992;179-189.
36. Fang L., Li T. Design of competition based neural networks for combinatorial optimization. Int J Neural Systems. 1:1990;221-235.
37. Pellerin D., Herault J. Scheduling with neural networks. application to timetable construction Neurocomputing. 6(4):1994;419-442.
38. Min H-.S., Yih Y., Kim C-.O. Competitive neural network approach to multi-objective FMS scheduling. Int J Prod Res. 36(7):1998;1749-1765.
39. Chryssolouris G., Lee M., Domroese M. The use of neural networks in determining operational policies for manufacturing systems. J Manuf Systems. 10:1991;166-175.
40. Hayes P.V., Sayeh S.I. Supervised neural network approach to optimization as applied to the N-job, M-machine job sequencing problem. Intell Eng Systems Artif Neural Networks. 2:1992;943-948.
41. Rabelo L, Jones A, Tsai J. Using hybrid systems for FMS scheduling. The 2nd Industrial Engineering Research Conference Proceedings, 1993, p. 471-5.
42. Yih Y., Liang T-.P., Moskowitz H. Robot scheduling in a circuit board production line. a hybrid OR/ANN approach IIE Trans. 25(2):1993;26-33.
43. Luh PB, Zhao X, Wang Y, Thakur TS. Lagrangian relaxation neural networks for job shop scheduling. Proceedings of International Conference on Robotics and Automation, Leuven, Belgium, 1998, p. 1799-804.
44. Luh PB, Zhao X, Wang Y, Thakur TS. Lagrangian relaxation neural networks for job shop scheduling. Proceedings of NSF/DMII Grantees Conference, Long Beach, California, 1999.
45. Goffman E.G., Garey M.R., Johnson D.S. An application of bin-packing to multiprocessor scheduling. SIAM Journal of Computing. 7:1978;1-17.