Skip to main content
SpringerLink
Log in

Solving a multi-objective overlapping flow-shop scheduling

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

Abstract

In flow-shop manufacturing scheduling systems, managers attempt to minimize makespan and manufacturing costs. Job overlaps are typically unavoidable in real-life applications as overlapping production shortens operation throughput times and reduces work-in-process inventories. This study presents an ant colony optimization (ACO) heuristic for establishing a simple and effective mechanism to solve the overlap manufacturing scheduling problem with various ready times and a sequentially dependent setup time. In the proposed approach, the scheduling mechanism and ACO heuristics are developed separately, thereby improving the performance of overlapping manufacturing flow by varying parameters or settings within the ACO heuristics and allowing for flexible application of manufacturing by altering scheduling criteria. Finally, the experimental results of the scheduling problem demonstrate that the ACO heuristics have good performance when searching for answers.

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

Reference

  1. Sumunt TL, Buss AH, Kropp DH (1996) Lot splitting in stochastic flow shop and job shop environments. Decis Sci 27:215–237

    Google Scholar 

  2. Ramasesh RV, Haizhen F, Duncan KHF, Jack CH (2000) Lot streaming in multistage production system. Int J Prod Econ 66:199–211 doi:10.1016/S0925-5273(99)00124-3

    Article  Google Scholar 

  3. Baker KR, Pyke DF (1990) Solution procedures for the lot-streaming problem. Decis Sci 21:475–491 doi:10.1111/j.1540-5915.1990.tb00328.x

    Article  Google Scholar 

  4. Potts CN, Van-Wassenhove LN (1992) Integrating scheduling with bathing and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395–406

    Article  MATH  Google Scholar 

  5. Trietsch D, Baker KR (1993) Basic techniques for lot streaming. Oper Res 41:1065–1076

    Article  MATH  Google Scholar 

  6. Lee SC, Hsu TS, Chuang SP, Yang CL (2008) Enhanced performance of overlap flow-shop scheduling involving reworking and a time buffer. Int J Adv Manuf Technol (in press). doi:10.1007/s00170-007-1192-8

  7. Graves SC, Kostreva MM (1986) Overlapping operations in material requirements planning. J Oper Manag 6:283–294 doi:10.1016/0272-6963(86)90004-5

    Article  Google Scholar 

  8. Moily JP (1986) Optimal and heuristic procedures for component lot-splitting in multi-stage manufacturing system. Manage Sci 32:113–125

    Article  MATH  Google Scholar 

  9. Karimi IA (1992) Optimal cycle time in multistage serial system with set-up and inventory costs. Manage Sci 38:1467–1481

    Article  MATH  Google Scholar 

  10. Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, Dipartmento di Elettronica, Politecnico di Milano, Italy (in Italian)

  11. Dorigo M, Di-Caro G, Gambardella LM (1995) Ant algorithms for discrete optimization. Artif Life 5:137–172 doi:10.1162/106454699568728

    Article  Google Scholar 

  12. Ying KC, Liao CJ (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31:791–801 doi:10.1016/S0305-0548(03)00038-8

    Article  MATH  Google Scholar 

  13. 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 

  14. 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 

  15. 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 

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

  17. Zheng WX, Nagasawa H, Nishiyama N (1993) single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties. Int J Prod Res 31:1611–1620 doi:10.1080/00207549308956812

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate Institute of Management, Fu Jen Catholic University, No. 510, Chung-Cheng Rd., Hsinchuang City, Taipei Hsien, 24205, Taiwan, Republic of China

    Rong-Hwa Huang

  2. Department of Business Administration, Fu Jen Catholic University, No.510, Chung-Cheng Rd., Hsinchuang City, Taipei Hsien, 24205, Taiwan, Republic of China

    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

Corresponding author

Correspondence to Chang-Lin Yang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, RH., Yang, CL. Solving a multi-objective overlapping flow-shop scheduling. Int J Adv Manuf Technol 42, 955–962 (2009). https://doi.org/10.1007/s00170-008-1652-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1652-9

Keywords

Search

Navigation