Skip to main content
SpringerLink
Log in

Permutation flowshops with transportation times: mathematical models and solution methods

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper deals with permutation flowshops with considering transportation times of carrying semi-finished jobs from a machine to another one. The transportation between machines can be done using two types of transportation systems: multi-transporter and single-transporter systems. We formulate the problem with both systems as six different mixed integer linear programs. We also provide solution methods including heuristics and metaheuristics in order to solve large-sized problems. The heuristics are the adaptations of well-known heuristics and the proposed metaheuristics are based on artificial immune systems incorporating an effective local search heuristic and simulated annealing. A comprehensive experiment is conducted to compare and evaluate the performance of the models as well as the algorithms. All the results show the effectiveness of the proposed models and algorithms.

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

  1. Baker KR (1974) Introduction to sequence and scheduling. Wiley, USA

    Google Scholar 

  2. Bowman EH (1959) The scheduling-sequence problem. Oper Res 7:621–624

    Article  Google Scholar 

  3. Boudhar M, Haned A (2008) Preemptive scheduling in the presence of transportation times. Comput Oper Res . doi:10.1016/j.cor.2008.09.006

    Google Scholar 

  4. Brucker P, Knust S, Edwin Cheng TC, Shakhlevich NV (2004) Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Ann Oper Res 129:81–106

    Article  MATH  MathSciNet  Google Scholar 

  5. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for n-job, m-machine sequencing problem. Manag Sci 16:630–637

    Article  Google Scholar 

  6. Engin O, Döyen A (2004) A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener Comput Syst 20:1083–1095

    Article  Google Scholar 

  7. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and job shop scheduling. Math Oper Res 1:117–129

    Article  MATH  MathSciNet  Google Scholar 

  8. Goldberg DE (1989) Genetic algorithms in search, optimisation and machine learning. Reading, Addison-Wesley

    Google Scholar 

  9. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  10. Hurink J, Knust S (2001) Makespan minimization for flowshop problems with transportation times and a single robot. Discrete Appl Math 112:199–216

    Article  MATH  MathSciNet  Google Scholar 

  11. Hurink J, Knust S (2005) Tabu search algorithms for job-shop problems with a single transport robot. Eur J Oper Res 162:99–111

    Article  MATH  Google Scholar 

  12. Johnson SM (1954) Optimal two and three-stage production schedules with setup times included. Nav Res Logist Q 1:61–67

    Article  Google Scholar 

  13. Langston MA (1987) Interstage transportation planning in the deterministic flow-shop environment. Oper Res 35:556–564

    Article  Google Scholar 

  14. Lian Z, Gu X, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Chaos Solitons Fractals 35:851–861

    Article  MATH  Google Scholar 

  15. Manne AS (1960) On the job shop scheduling problem. Oper Res 8:219–223

    Article  MathSciNet  Google Scholar 

  16. Naderi B, Khalili M, Tavakkoli-Moghaddam R (2008) A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Comput Ind Eng . doi:10.1016/j.cie.2008.09.031

    MATH  Google Scholar 

  17. Naderi B, Zandieh M, Roshanaei V (2008) Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. Int J Adv Manuf Technol . doi:10.1007/s00170-008-1569-3

    MATH  Google Scholar 

  18. Naderi B, Zandieh M, Khaleghi Ghoshe Balagh A, Roshanaei V (2008) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems Appl . doi:10.1016/j.eswa.2008.09.063

    MATH  Google Scholar 

  19. Nawaz M, Enscore E, Ham T (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA Int J Manag Sci 11:91–95

    Article  Google Scholar 

  20. Noorul Haq A, Saravanan M, Vivekraj AR, Prasad T (2007) A scatter search approach for general flowshop scheduling problem. Int J Adv Manuf Technol 31:731–736

    Google Scholar 

  21. Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimal total time—a quick method of obtaining a near optimum. Oper Res Q 16:101–107

    Article  Google Scholar 

  22. Pan CH (1997) A study of integer programming formulations for scheduling problems. Int J Syst Sci 28(1):33–41

    Article  MATH  Google Scholar 

  23. R.Z. Rios-Mercado, J.F. Bard, 1996. The flowshop scheduling polyhedron with setup times. Technical report ORP 96–07, graduate program in operations research, University of Texas at Austin, Austin, TX.

  24. Saravanan M, Noorul Haq A, Vivekraj AR, Prasad T (2008) Performance evaluation of the scatter search method for permutation flowshop sequencing problems. Int J Adv Manuf Technol 37:1200–1208

    Article  Google Scholar 

  25. Soukhal A, Oulamara A, Martineau P (2005) Complexity of flow shop scheduling problems with transportation constraints. Eur J Oper Res 161:32–41

    Article  MATH  MathSciNet  Google Scholar 

  26. Stafford EF Jr, Tseng FT, Gupta JND (2005) Comparative evaluation of MILP flowshop models. J Oper Res Soc 56:88–101

    Article  MATH  Google Scholar 

  27. Strusevich VA (1999) A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Appl Math 93:287–304

    Article  MATH  MathSciNet  Google Scholar 

  28. Sule DR (1997) Industrial scheduling. PWS, USA

    MATH  Google Scholar 

  29. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

    Article  MATH  Google Scholar 

  30. Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072–5090

    Article  MATH  MathSciNet  Google Scholar 

  31. Wagner HM (1959) An integer linear-programming model for machine scheduling. Nav Res Logist Q 6:131–140

    Article  Google Scholar 

  32. Yuan J, Soukhal A, Chen Y, Lu L (2007) A note on the complexity of flow shop scheduling with transportation constraints. Eur J Oper Res 178:918–925

    Article  MATH  MathSciNet  Google Scholar 

  33. Zandieh M, Fatemi Ghomi SMT, Moattar Husseini SM (2006) An immune algorithm approach to hybrid flowshops scheduling with sequence dependent setup times. Appl Math Comput 180:111–127

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    B. Naderi & A. Ahmadi Javid

  2. Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran

    F. Jolai

Authors
  1. B. Naderi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ahmadi Javid
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Jolai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. Naderi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Naderi, B., Ahmadi Javid, A. & Jolai, F. Permutation flowshops with transportation times: mathematical models and solution methods. Int J Adv Manuf Technol 46, 631–647 (2010). https://doi.org/10.1007/s00170-009-2122-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2122-8

Keywords

Search

Navigation