An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times

Applied Mathematics and Computation

Volumn 180, Issue 1, 2006, Pages 111-127

  Zandieh, M ^a   Fatemi Ghomi, S M T ^a   Moattar Husseini, S M ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Heuristics; Hybrid flow shops; Immune algorithms; Makespan; Sequence dependent setup times; Short term scheduling

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; PRINTED CIRCUIT BOARDS; RANDOM PROCESSES;

HYBRID FLOW SHOPS; IMMUNE ALGORITHMS; SEQUENCE DEPENDENT SETUP TIMES; SHORT-TERM SCHEDULING;

OPERATIONS RESEARCH;

EID: 33748321077     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.11.136     Document Type: Article

References (73)

1. Abramson N. Information Theory and Coding (1963), McGrawHill, New York
2. Ada G.L., and Nossal G.J.V. The clonal selection theory. Scientific American 257 (1987) 50-57
3. Adler L.B., et al. BPSS: a scheduling support system for the package industry. Journal of Operations Research 4 1 (1993) 641-648
4. Arthanary T.S., and Ramaswamy K.G. An extension of two machine sequencing problems. Operations Research 8 (1971) 10-22
5. Brah S.A., and Hunsucker J.L. Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research 51 (1991) 88-99
6. Brah S.A., and Loo L.L. Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research 113 (1999) 113-122
7. L.N. de Castro, J. Timmis, An artificial immune network for multimodal function optimization, Evolutionary Computation, CEC'02, in: Proceedings of the 2002 Congress, 2002, pp. 699-704.
8. Chen J.S., Kim M.K., and Jong H.K. Shape optimization of electromagnetic devices using immune algorithm. IEEE Transactions on Magnetics 33 (1997) 1876-1879
9. Chen B. Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage. Journal of the Operational Research Society 46 (1995) 234-244
10. Dasgupta D., and Attoh-Okine N. Immunity-based systems: a survey. Proceedings of the IEEE International Conference on Computational Cybernetic Simulation 1 (1997) 369-374
11. Dasgupta D. Special issue on artificial immune system. IEEE Transactions on Evolutionary Computation 6 (2002) 225-256
12. Ding F.-Y., and Kittichatphayak D. Heuristics for scheduling flexible flow lines. Computers and Industrial Engineering 26 1 (1994) 27-34
13. S.E. Elmaghraby, R.E. Karnoub, Production control in flexible flowshops: an example from textile manufacturing, OR Report No. 305 OR and IE Department, North Carolina State University, USA, 1995.
14. Frank S.A., Rose M.R., and Lauder G.V. The Design of Natural and Artificial Adaptive Systems (1996), Academic Press, New York
15. Goldberg D.E. Genetic Algorithms in Search Optimization and Machine Learning (1953), Addison-Wesley, Reading, MA
16. Guinet A., et al. A computational study of heuristics for two-stage flexible flowshops. Journal of Operations Research 34 (1996) 1399-1415
17. Gupta J.N.D. Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society 38 (1988) 359-364
18. Gupta J.N.D., and Tunc E.A. Schedules for a two stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research 29 (1991) 1489-1502
19. Gupta J.N.D., and Tunc E.A. Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research 77 (1994) 415-428
20. Gupta J.N.D., Hadri A.M.A., and Potts C.N. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Journal of Operations Research 69 (1997) 171-191
21. Gupta J.N.D. A flowshop scheduling problem with two operations per job. International Journal of Production Research 35 8 (1997) 2309-2325
22. Gutnikov S., and Melnikov Y. A simple non-linear model of immune response. Chaos, Solitons & Fractals 16 (2003) 125-132
23. Hoogeveen J.A., Lenstra J.K., and Velteman B. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research 89 (1996) 172-175
24. Huang S.T. An immune-based optimization method to capacitor placement in a radial distribution system. IEEE Transactions on Power Delivery 15 (2000) 744-749
25. Huang S.T. Application of immune based optimization method for fault-section estimation in a distribution system. IEEE Transactions on Power Delivery 17 (2002) 779-784
26. Hung T.S.L., and Ching J.L. A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86 (2003) 133-143
27. Jiao L., and Wang L. Novel genetic algorithm based on immunity. IEEE Transaction System Manufacturing Cybernetic, Part A 30 5 (2000) 552-561
28. Johnson S.M. Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-67
29. Khoo L.P., Lee S.G., and Yin X.F. A prototype genetic algorithm-enhanced multi-objective scheduler for manufacturing systems. International Journal of Advanced Manufacturing Technology 16 (2000) 131-138
30. Kochhar S., and Morris R.J.T. Heuristic methods for flexible flow line scheduling. Journal of Manufacturing Systems 6 4 (1987) 299-314
31. Kurz M.E., and Askin R.G. Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research 39 16 (2001) 3747-3769
32. Kurz M.E., and Askin R.G. Note on "an adaptable problem-space-based search method for flexible flow line scheduling". IIE Transactions 33 8 (2001) 691-693
33. Kurz M.E., and Askin R.G. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85 (2003) 371-388
34. Kurz M.E., and Askin R.G. Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159 1 (2004) 66-82
35. Lee C.-Y., and Vairaktarakis G.L. Minimizing makespan in hybrid flowshops. Operations Research Letters 16 (1994) 149-158
36. Lee I., Sikora R., and Shaw M.J. A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Transactions on Systems, Manufacturing, and Cybernetics, Part B 27 1 (1997) 36-54
37. Leon V.J., and Ramamoorthy B. An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions 29 (1997) 115-125
38. Luh P.B., Gou L., Zhang Y., Nagahora T., Tsuji M., Yoneda K., Hasegawa T., Kyoya Y., and Kano T. Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annual of Operation Research 76 (1998) 233-259
39. Michalewicz Z. Genetic Algorithms + Data Structure = Evolution Programs (1994), Springer, New York
40. MittaI B.S., and Nagga P.C. Two machine sequencing problem with parallel machines. Operations Research 10 (1973) 50-61
41. Mori K., Tsukiyama M., and Fukuda T. Immune algorithm with searching diversity and its application to resource allocation problem. Transactions of IEE Japan 113C (1993) 872-878
42. Narasimhan S.L., and Panwalkar S.S. Scheduling in a two-stage manufacturing process. International Journal of Production Research 22 (1984) 555-564
43. Narasimhan S., and Mangiameli P. A comparison of sequencing rules for a two-stage hybrid flow shop. Decision Science 18 (1987) 250-265
44. Norman B.A., and Bean J.C. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics 46 (1999) 199-211
45. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91 (1996) 160-175
46. Nowicki E., and Smutnicki C. An approximation algorithm for a single-machine scheduling problem with release times and delivery times. Discrete Applied Mathematics 48 (1994) 69-79
47. Nowicki E., and Smutnicki C. The flow shop with parallel machines: a tabu search approach. European Journal of Operational Research 106 (1998) 226-253
48. Oguz C., Lin B.M.T., and Cheng T.C.E. Two-stage flowshop scheduling with a common second-stage machine. Computers and Operations Research 24 12 (1997) 1169-1174
49. Pinedo M. Scheduling Theory, Algorithms, and Systems (1995), Prentice-Hall, Englewood Cliffs, NJ
50. Rajendran C., and Chaudhuri D. Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan. International Journal of Production Economics 27 (1992) 137-143
51. Riane F., Artiba A., and Elmaghraby S.E. A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. European Journal of Operational Research 109 (1998) 321-329
52. Rios-Mercado R.Z., and Bard J.F. Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Computers and Operations Research 25 5 (1998) 351-366
53. Salvador M.S. A solution to a special case of flow shop scheduling problems. In: Elmaghraby S.E. (Ed). Symposium on the Theory of Scheduling and its Applications (1973), Springer, Berlin 83-91
54. Santos D.L., Hunsucker J.L., and Deal D.E. FLOWMULT: permutation sequences for flow shops with multiple processors. Journal of Information and Optimization Sciences 16 2 (1995) 351-366
55. Santos D.L., Hunsucker J.L., and Deal D.E. An evaluation of sequencing heuristics in flow shops with multiple processors. Computers and Industrial Engineering 30 4 (1996) 681-692
56. T.J. Sawik, A scheduling algorithm for flexible flow lines with limited intermediate buffers, in: Proceedings of the Eighth International Conference on CAD/CAM, Robotics and Factories of the Future, Metz, France, vol. 2, 1992, pp. 1711-1722.
57. T.J. Sawik, New algorithms for scheduling flexible flow lines, in: Proceedings of the 1994 Japan-USA Symposium on Flexible Automation, Kobe, Japan, vol. 3, 1994, pp. 1091-1094.
58. Sawik T.J. Scheduling flexible flow lines with no in-process buffers. International Journal of Production Research 33 5 (1995) 1357-1367
59. Shao X.G., Chen Z.H., and Lin X.Q. Resolution of multicomponent overlapping chromatogram using an immune algorithm and genetic algorithm. Chemometrics and Intelligent Laboratory System 50 (2000) 91-99
60. Srikar B.N., and Ghosh S. A MILP model for the N-job, M-stage flowshop with sequence dependent set-up times. International Journal of Production Research 24 6 (1986) 1459-1474
61. Sriskandarajah C., and Sethi S.P. Scheduling algorithms for flexible flowshops: worst and average case performance. European Journal of Operational Research 43 (1989) 143-160
62. Stafford E.F. On the development of a mixed-integer linear programming model for the flowshop sequencing problem. Journal of the Operational Research Society 39 12 (1988) 1163-1174
63. Stafford E.F., and Tseng F.T. On the Srikar-Ghosh MILP model for the N * M SDST flowshop problem. International Journal of Production Research 28 10 (1990) 1817-1830
64. Storer R.H., Wu S.D., and Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Science 38 10 (1992) 1495-1509
65. Sule D.R. Sequencing n jobs on two machines with setup, processing and removal times separated. Naval Research Logistics Quarterly 29 (1982) 517-519
66. Szwarc W., and Gupta J.N.D. A flow-shop with sequence dependent additive setup times. Naval Research Logistics 34 (1987) 619-627
67. Vignier A., et al. A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop. IEEE 6th International Conference on Emerging Technologies and Factory Automation 1 (1996) 215-220
68. Vignier A., Commandeur P., and Proust C. New lower bound for the hybrid flowshop scheduling problem. IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings (1997) 446-451
69. Wittrock R. Scheduling algorithms for flexible flow lines. IBM Journal of Research and Development 29 24 (1985) 401-412
70. Wittrock R. An adaptable scheduling algorithm for flexible flow lines. Operations Research 36 3 (1988) 445-453
71. Zandieh M., and Fatemi S.M.T. A framework and a classification scheme for modelling production systems. Proceedings of the Second National Industrial Engineering Conference (2003), Yazd University, Yazd, Iran 308-315
72. J.R. Zhou, D. Huang, W.S. Jiang, Optimization production scheduling of multi-stage interrelated discrete system via synthetic knowledge, in: Proceedings of the American Control Conference, 1996, pp. 724-728.
73. de Castro L.N., and Von Zuben F.J. Learning and optimization using the clonal selection principle. IEEE Transactions on Evolutionary Computation 6 (2002) 239-251