IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v141y2013i1p286-294.html
   My bibliography  Save this article

Two-machine flow shop scheduling of polyurethane foam production

Author

Listed:
  • Lin, Bertrand M.T.
  • Lin, Y.-Y.
  • Fang, K.-T.

Abstract

This paper studies a two-machine flow shop scheduling problem with a supporting precedence relation. The model originates from a real production context of a chemical factory that produces foam-rubber products. We extend the traditional two-machine flow shop by dividing the operations into two categories: supporting tasks and regular jobs. In the model, several different compositions of foam rubber can be mixed at the foam blooming stage, and products are processed at the manufacturing stage. Each job (product) on the second machine cannot start until its supporting tasks (parts) on the first machine are all finished and the second machine is not occupied. The objective is to find a schedule that minimizes the total job completion time. The studied problem is strongly NP-hard. In this paper, we propose a branch-and-bound algorithm incorporating a lower bound and two dominance rules. We also design a simple heuristic and an iterated local search (ILS) algorithm to derive approximate solutions. The performances of the proposed algorithms are examined through computational experiments.

Suggested Citation

  • Lin, Bertrand M.T. & Lin, Y.-Y. & Fang, K.-T., 2013. "Two-machine flow shop scheduling of polyurethane foam production," International Journal of Production Economics, Elsevier, vol. 141(1), pages 286-294.
    • Handle: RePEc:eee:proeco:v:141:y:2013:i:1:p:286-294
    DOI: 10.1016/j.ijpe.2012.08.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527312003374
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2012.08.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Feng & Lee, Chung-Yee, 2009. "Minimizing the makespan in a two-machine cross-docking flow shop problem," European Journal of Operational Research, Elsevier, vol. 193(1), pages 59-72, February.
    2. B. M. T. Lin & J. M. Wu, 2005. "A Simple Lower Bound For Total Completion Time Minimization In A Two-Machine Flowshop," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 22(03), pages 391-407.
    3. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2008. "Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop," International Journal of Production Economics, Elsevier, vol. 113(2), pages 819-833, June.
    4. Haouari, Mohamed & Hidri, Lotfi, 2008. "On the hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 113(1), pages 495-497, May.
    5. Della Croce, F. & Narayan, V. & Tadei, R., 1996. "The two-machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 227-237, April.
    6. Ahmadi, Reza H. & Bagchi, Uttarayan, 1990. "Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop," European Journal of Operational Research, Elsevier, vol. 44(3), pages 331-336, February.
    7. Della Croce, F. & Ghirardi, M. & Tadei, R., 2002. "An improved branch-and-bound algorithm for the two machine total completion time flow shop problem," European Journal of Operational Research, Elsevier, vol. 139(2), pages 293-301, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yen-Shing Tsai & Bertrand M. T. Lin, 2016. "Flow shop non-idle scheduling and resource-constrained scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 577-585, March.
    2. Detienne, Boris & Sadykov, Ruslan & Tanaka, Shunji, 2016. "The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation," European Journal of Operational Research, Elsevier, vol. 252(3), pages 750-760.
    3. Yen-Shing Tsai & Bertrand Lin, 2016. "Flow shop non-idle scheduling and resource-constrained scheduling," Annals of Operations Research, Springer, vol. 238(1), pages 577-585, March.
    4. Gharbi, Anis & Ladhari, Talel & Msakni, Mohamed Kais & Serairi, Mehdi, 2013. "The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies," European Journal of Operational Research, Elsevier, vol. 231(1), pages 69-78.
    5. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    6. S Yanai & T Fujie, 2006. "A three-machine permutation flow-shop problem with minimum makespan on the second machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 460-468, April.
    7. J. A. Hoogeveen & T. Kawaguchi, 1999. "Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases," Mathematics of Operations Research, INFORMS, vol. 24(4), pages 887-910, November.
    8. Allahverdi, Ali & Al-Anzi, Fawaz S., 2006. "A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times," European Journal of Operational Research, Elsevier, vol. 169(3), pages 767-780, March.
    9. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2014. "A matheuristic approach for the two-machine total completion time flow shop problem," Annals of Operations Research, Springer, vol. 213(1), pages 67-78, February.
    10. Lin, B.M.T. & Lu, C.Y. & Shyu, S.J. & Tsai, C.Y., 2008. "Development of new features of ant colony optimization for flowshop scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 742-755, April.
    11. Lee, Wen-Chiung & Wu, Chin-Chia, 2004. "Minimizing total completion time in a two-machine flowshop with a learning effect," International Journal of Production Economics, Elsevier, vol. 88(1), pages 85-93, March.
    12. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2002. "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," International Journal of Production Economics, Elsevier, vol. 79(3), pages 185-196, October.
    13. Mohamed Ali Rakrouki & Anis Kooli & Sabrine Chalghoumi & Talel Ladhari, 2020. "A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates," Operational Research, Springer, vol. 20(1), pages 21-35, March.
    14. Akkan, Can & Karabati, Selcuk, 2004. "The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 159(2), pages 420-429, December.
    15. Ladhari, Talel & Rakrouki, Mohamed Ali, 2009. "Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop," International Journal of Production Economics, Elsevier, vol. 122(2), pages 678-691, December.
    16. Allahverdi, Ali & Aldowaisan, Tariq, 2002. "New heuristics to minimize total completion time in m-machine flowshops," International Journal of Production Economics, Elsevier, vol. 77(1), pages 71-83, May.
    17. Mohammad Amin Amani & Mohammad Mahdi Nasiri, 2023. "A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-32, July.
    18. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    19. Chengen Wang & Chengbin Chu & Proth, Jean-Marie, 1997. "Heuristic approaches for n/m/F/ [summation operator]Ci scheduling problems," European Journal of Operational Research, Elsevier, vol. 96(3), pages 636-644, February.
    20. Shi, Wen & Liu, Zhixue & Shang, Jennifer & Cui, Yujia, 2013. "Multi-criteria robust design of a JIT-based cross-docking distribution center for an auto parts supply chain," European Journal of Operational Research, Elsevier, vol. 229(3), pages 695-706.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:141:y:2013:i:1:p:286-294. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.