Skip to main content

Advertisement

SpringerLink
Log in

A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

One of the scheduling problems with various applications in industries is hybrid flow shop. In hybrid flow shop, a series of n jobs are processed at a series of g workshops with several parallel machines in each workshop. To simplify the model construction in most research on hybrid flow shop scheduling problems, the setup times of operations have been ignored, combined with their corresponding processing times, or considered non sequence-dependent. However, in most real industries such as chemical, textile, metallurgical, printed circuit board, and automobile manufacturing, hybrid flow shop problems have sequence-dependent setup times (SDST). In this research, the problem of SDST hybrid flow shop scheduling with parallel identical machines to minimize the makespan is studied. A novel simulated annealing (NSA) algorithm is developed to produce a reasonable manufacturing schedule within an acceptable computational time. In this study, the proposed NSA uses a well combination of two moving operators for generating new solutions. The obtained results are compared with those computed by Random Key Genetic Algorithm (RKGA) and Immune Algorithm (IA) which are proposed previously. The results show that NSA outperforms both RKGA and IA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aarts E. H. L., Korst J. (1989) Simulated annealing and boltzmann machines: A stochastic approach to combinatorial optimization and neural computing. Wiley, Chi Chester, England

    Google Scholar 

  • Aarts E. H. L., Lenstra J. K. (1997) Local search in combinatorial optimization. Wiley, Chi Chester, England

    Google Scholar 

  • Adenso-Diaz B. (1996) An SA/TS mixture algorithm for the scheduling tardiness problem. European Journal of Operational Research 88: 516–524

    Article  Google Scholar 

  • Allaoui H., Artiba A. (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers & Industrial Engineering 47: 431–450

    Article  Google Scholar 

  • Arthanary T. S., Ramaswamy K.G. (1971) An extension of two machine sequencing problems. Operations Research 8: 10–22

    Google Scholar 

  • Chen B., Luk B. L. (1999) Adaptive simulated annealing for optimization in signal processing applications. Signal Processing 79: 117–128

    Article  Google Scholar 

  • Eglese R. W. (1990) Simulated annealing: A tool for operational research. European Journal of Operational Research 46: 271–281

    Article  Google Scholar 

  • Fleischer, M. A. (1995). Assessing the performance of the simulated annealing algorithm using information. Theory (Doctoral Dissertation), Department of Operations Research, Case Western Reserve University, Cleveland, Ohio.

  • Fleischer, M. A. (1995). Simulated annealing: Past, present, and future. In: C. Alexopoulos, K. Kang, W. R. Lilegdon and D. Goldsman (eds.), Proceedings of the 1995 Winter Simulation Conference, IEEE Press, pp. 155–161.

  • Glover F., Kochenberger G. A. (2003) Handbook of metaheuristics. Stanford University, Stanford

    Google Scholar 

  • Gupta J. N. D., Tunc E. A. (1994) Scheduling a two-stage hybrid flow shop with separable setup and removal times. European Journal of Operational Research 77: 415–428

    Article  Google Scholar 

  • Hamma B., Viitanen S., Torn A. (2000) Parallel continuous simulated annealing for global optimization. Optimization Methods and Software 13: 95–116

    Article  Google Scholar 

  • Hung T. S. L., Ching J. L. (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86: 133–143

    Article  Google Scholar 

  • Ishibuchi H., Yamamoto N., Misaki S., Tanaka H. (1994) Local search algorithms for flow shop scheduling with fuzzy due-dates. International Journal of Production Economics 33: 53–66

    Article  Google Scholar 

  • Janiak A., Kozan E., Lichtenstein M., Oğuz C. (2007) Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics 105: 407–424

    Article  Google Scholar 

  • Jin Z., Yang Z., Ito T. (2006) Metaheuristic algorithms for the multistage hybrid flow shop scheduling problem. International Journal of Production Economics 100: 322–334

    Article  Google Scholar 

  • Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. (1989) Optimization by simulated annealing—an experimental evaluation; part 1, graph partitioning. Operations Research 37: 865–892

    Article  Google Scholar 

  • Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. (1991) Optimization by simulated annealing—an experimental evaluation; part 2, graph-coloring and number partitioning. Operations Research 39: 378–406

    Article  Google Scholar 

  • Johnson S. M. (1954) Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1: 61–67

    Article  Google Scholar 

  • Karasakal E. K., Köksalan M. (2000) A simulated annealing approach to bi-criteria scheduling problems on a single machine. Journal of Heuristics 6: 311–327

    Article  Google Scholar 

  • Kim Y. D., Lim H. G., Park M. W. (1996) Search heuristics for a flow shop scheduling problem in a printed circuit board assembly process. European Journal of Operational Research 91: 124–143

    Article  Google Scholar 

  • Kochhar S., Morris R. J. T. (1987) Heuristic methods for flexible flow line scheduling. Journal of Manufacturing Systems 6(4): 299–314

    Article  Google Scholar 

  • Koulamas C., Antony S. R., Jaen R. (1994) A survey of simulated annealing applications to operations-research problems. OMEGA-International Journal of Management Science 22: 41–56

    Article  Google Scholar 

  • Kurz M. E., Askin R. G. (2003) Comparing scheduling rules for flexible flow lines. International Journal of Production Economics 85: 371–388

    Article  Google Scholar 

  • Kurz M. E., Askin R. G. (2004) Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research 159(1): 66–82

    Article  Google Scholar 

  • Lee I., Sikora R., Shaw M.J. (1997) 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): 36–54

    Article  Google Scholar 

  • Leite J. P. B., Topping B. H. V. (1999) Parallel simulated annealing for structural optimization. Computers and Structures 73: 545–564

    Article  Google Scholar 

  • Leon V. J., Ramamoorthy B. (1997) An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions 29: 115–125

    Google Scholar 

  • Lin H., Liao C. (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics 86: 133–143

    Article  Google Scholar 

  • Liu C. Y., Chang S. C. (2000) Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation 16: 408–419

    Article  Google Scholar 

  • Low C. (2005) Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers and Operations Research 32: 2013–2025

    Article  Google Scholar 

  • Luh P. B., Gou L., Zhang Y., Nagahora T., Tsuji M., Yoneda K., Hasegawa T., Kyoya Y., Kano T. (1998) Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annual of Operation Research 76: 233–259

    Article  Google Scholar 

  • Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. (1953) Equation of state calculations by fast computing machines. Journal of Chemical Physics 21: 1087–1092

    Article  Google Scholar 

  • Nawaz J., Enscore E. E., Ham I. (1983) A heuristic algorithm for the m-machine, n-job sequencing problem. OMEGA 11: 91–95

    Article  Google Scholar 

  • Nearchou A. C. (2004) A novel metaheuristic approach for the flow shop scheduling problem. Engineering Applications of Artificial Intelligence 17: 289–300

    Article  Google Scholar 

  • Nearchou A. C. (2004) Flow shop sequencing using hybrid simulated annealing. Journal of Intelligent Manufacturing 15: 317–328

    Article  Google Scholar 

  • Ogbu F. A., Smith D. K. (1990) The application of the simulated annealing algorithm to the solution of the n/m/C max flow shop problem. Computers & Operations Research 17(3): 243–253

    Article  Google Scholar 

  • Osman I. H., Potts C. N. (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6): 551–557

    Article  Google Scholar 

  • Ovacik I. M., Uzsoy R. (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence- dependent setup times. International Journal of Production Research 33: 3173–3192

    Article  Google Scholar 

  • Ovacik I. M., Rajagopalan S., Uzsoy R. (2000) Integrating interval estimates of global optima and local search methods for combinatorial optimization problems. Journal of Heuristics 6: 481–500

    Article  Google Scholar 

  • Pinedo M. (1995) Scheduling theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  • Pugazhendhi S., Thiagarajan S., Rajendran C., Anantharaman N. (2004) Generating non-permutation schedules in flow line based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach. International Journal of Advanced Manufacturing Technology 23: 64–78

    Article  Google Scholar 

  • Rios-Mercado R. Z., Bard J. F. (1998) Computational experience with a branch-and-cut algorithm for flow shop scheduling with setups. Computers and Operations Research 25(5): 351–366

    Article  Google Scholar 

  • Romeo F., Sangiovanni-Vincentelli A. (1991) A theoretical framework for simulated annealing. Algorithmica 6: 302–345

    Article  Google Scholar 

  • Ruiz R., Maroto C. (2006) A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. European Journal of Operational Research 169: 781–800

    Article  Google Scholar 

  • Ruiz R., Stützle T. (2008) An iterated greedy heuristic for the sequence dependent setup times flow shop with makespan and weighted tardiness objectives. European Journal of Operational Research 187: 1143–1159

    Article  Google Scholar 

  • Sadegheih A. (2006) Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance. Applied Mathematical Modeling 30: 147–154

    Article  Google Scholar 

  • Srikar B. N., Ghosh S. (1986) A MILP model for the N-job, M-stage flow shop with sequence dependent set-up times. International Journal of Production Research 24(6): 1459–1474

    Article  Google Scholar 

  • Stafford E. F., Tseng F. T. (1990) On the Srikar-Ghosh MILP model for the N × M SDST flowshop problem. International Journal of Production Research 28(10): 1817–1830

    Article  Google Scholar 

  • Sule D. R. (1982) Sequencing n jobs on two machines with setup, processing and removal times separated. Naval Research Logistics Quarterly 29: 517–519

    Article  Google Scholar 

  • Szwarc W., Gupta J. N. D. (1987) A flow shop with sequence. Dependent additive setup times. Naval Research Logistics 34: 619–627

    Article  Google Scholar 

  • Uskup E., Smith S. B. (1975) A branch and bound algorithm for two-stage production sequencing problems. Operations Research 23: 118–136

    Article  Google Scholar 

  • Vakharia A. J., Chang Y. L. (1990) A simulated annealing approach to scheduling a manufacturing cell. Naval Research Logistics 37: 559–577

    Article  Google Scholar 

  • Van Laarhoven P. J. M., Aarts E. H. L. (1987) Simulated annealing: Theory and applications. D. Reidel Kluwer, Academic Publisher, Dordrecht, Boston, Norwell, Massachusetts

    Google Scholar 

  • Wittrock R. (1985) Scheduling algorithms for flexible flow lines. IBM Journal of Research and Development 29(24): 401–412

    Article  Google Scholar 

  • Wittrock R. (1988) An adaptable scheduling algorithm for flexible flow lines. Operations Research 36(3): 445–453

    Article  Google Scholar 

  • Yim S. J., Lee D. Y. (1999) Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing. Journal of Intelligent Manufacturing 10(6): 531–540

    Article  Google Scholar 

  • Zandieh M., Fatemi S. M. T., Moattar Husseini S. M. (2006) An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation 180: 111–127

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

    H. S. Mirsanei

  2. Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, Tehran, Iran

    M. Zandieh

  3. Department of Computer Science and Information Technology, University Putra Malaysia, Serdang, Malaysia

    M. J. Moayed

  4. Department of Mechanical and Manufacturing Engineering, University Putra Malaysia, Serdang, Malaysia

    M. R. Khabbazi

Authors
  1. H. S. Mirsanei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Zandieh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. J. Moayed
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. R. Khabbazi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. S. Mirsanei.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mirsanei, H.S., Zandieh, M., Moayed, M.J. et al. A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. J Intell Manuf 22, 965–978 (2011). https://doi.org/10.1007/s10845-009-0373-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-009-0373-8

Keywords

Search

Navigation