Skip to main content
SpringerLink
Log in

No-wait two-stage multiprocessor flow shop scheduling with unit setup

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

Abstract

A well-arranged production schedule enhances equipment utility rate by distributing limited resources properly, which also improves efficiency and reduces costs. No-wait operations are among the most common production models. A wet batch in semiconductor packaging processes, for instance, is restricted by technical factors such as the chemical dye, which cannot be exposed to air for prolonged periods. Thus, a no-wait process between batches is necessary. This study considers a no-wait two-stage multiprocessor flow shop with setup time that minimizes total completion time. Integer programming model and an ant colony optimization (ACO) heuristic were implemented to test, analyze, and compare simulated data. The ACO results revealed that efficiency was substantially better than that achieved by integer programming, and the heuristic solutions were quite satisfactory.

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. Gupta JND, Strusevich VA, Zwaneveld CM (1997) Two-stage no-wait scheduling models with setup and removal times separated. Comput Oper Res 24:1025–1031. doi:10.1016/S0305-0548(97)00018-X

    Article  MATH  MathSciNet  Google Scholar 

  2. Thornton HW, Hunsucker JL (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Eur J Oper Res 152:96–114. doi:10.1016/S0377-2217(02)00524-6

    Article  MATH  MathSciNet  Google Scholar 

  3. Wang Z, Xing W, Bai F (2005) No-wait flexible flow shop scheduling with no-idle machines. Oper Res Lett 33:609–614. doi:10.1016/j.orl.2004.10.004

    Article  MATH  MathSciNet  Google Scholar 

  4. Kalczynski PJ, Kamburowsk J (2007) On no-wait and no-idle flow shops with makespan criterion. Eur J Oper Res 178:677–685. doi:10.1016/j.ejor.2006.01.036

    Article  MATH  Google Scholar 

  5. Aldowaisan T, Allahverdi A (1998) Total flow time in no-wait flow shops with separated setup times. Comput Oper Res 25:757–765. doi:10.1016/S0305-0548(98)00002-1

    Article  MATH  Google Scholar 

  6. Kravchenko SA, Werner F (2001) A heuristic algorithm for minimizing mean flow time with unit setups. Inf Process Lett 79:291–296. doi:10.1016/S0020-0190(01)00136-3

    Article  MATH  MathSciNet  Google Scholar 

  7. Low C (2005) Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput Oper Res 32:2013–2025. doi:10.1016/j.cor.2004.01.003

    Article  MATH  Google Scholar 

  8. Gupta JND (1988) Two-stage hybrid flow shop scheduling problem. J Oper Res Soc 34:359–364

    Article  Google Scholar 

  9. Brah SA (1988) Scheduling in a flow shop with multiprocessors. Diss Abstr Int 50:1587B

    Google Scholar 

  10. Gupta JND, Hariri AMA, Potts CN (1997) Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann Oper Res 69:171–191. doi:10.1023/A:1018976827443

    Article  MATH  Google Scholar 

  11. Santos DL, Hunsucker JL, Deal DE (2001) On makespan improvement in flow shops with multiple processors. Prod Plann Contr 12:283–295. doi:10.1080/095372801300107824

    Article  Google Scholar 

  12. Haouari M, Hidri L, Gharbi A (2006) Optimal scheduling of a two-stage hybrid flow shop. Math Methods Oper Res 64:107–124. doi:10.1007/s00186-006-0066-4

    Article  MATH  MathSciNet  Google Scholar 

  13. Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, DEI, Politecnico di Milano, Italy

  14. Fox B, Xiang W, Lee HP (2007) Industrial applications of the ant colony optimization algorithm. Int J Adv Manuf Technol 31:805–814. doi:10.1007/s00170-005-0254-z

    Article  Google Scholar 

  15. Alaykyran K, Engin O, Doyen A (2007) Using ant colony optimization to solve hybrid flow shop scheduling problems. Int J Adv Manuf Technol 35:541–550. doi:10.1007/s00170-007-1048-2

    Article  Google Scholar 

  16. Huang RH, Yang CL (2008) Overlapping production scheduling planning with multiple objectives-an ant colony approach. Int J Prod Econ 115:163–170. doi:10.1016/j.ijpe.2008.05.008

    Article  Google Scholar 

  17. Baykasoglu A, Dereli T (2008) Two-sided assembly line balancing using an ant-colony-based heuristic. Int J Adv Manuf Technol 36:582–588. doi:10.1007/s00170-006-0861-3

    Article  Google Scholar 

  18. Huang RH, Yang CL (2008) Ant colony system for job shop scheduling with time windows. Int J Adv Manuf Technol 39:151–157. doi:10.1007/s00170-007-1203-9

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate Institute of management, Fu Jen Catholic University, Hsinchuang, Taipei County, Taiwan

    Rong-Hwa Huang & Yau-Chi Huang

  2. Department of Business Administration, Fu Jen Catholic University, Hsinchuang, Taipei County, Taiwan

    Chang-Lin Yang

Authors
  1. Rong-Hwa Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chang-Lin Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yau-Chi Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chang-Lin Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, RH., Yang, CL. & Huang, YC. No-wait two-stage multiprocessor flow shop scheduling with unit setup. Int J Adv Manuf Technol 44, 921–927 (2009). https://doi.org/10.1007/s00170-008-1865-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1865-y

Keywords

Search

Navigation