IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v13y2021i5p2576-d507510.html
   My bibliography  Save this article

Minimizing the Makespan in Flowshop Scheduling for Sustainable Rubber Circular Manufacturing

Author

Listed:
  • Peng-Yeng Yin

    (Department of Information Management, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan
    Institute of Strategy and Development of Emerging Industry, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan)

  • Hsin-Min Chen

    (Institute of Strategy and Development of Emerging Industry, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan)

  • Yi-Lung Cheng

    (Department of Electrical Engineering, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan)

  • Ying-Chieh Wei

    (Institute of Strategy and Development of Emerging Industry, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan)

  • Ya-Lin Huang

    (Department of Information Management, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan)

  • Rong-Fuh Day

    (Department of Information Management, National Chi Nan University, No. 1, University Rd., Puli, Nantou 54561, Taiwan)

Abstract

It is estimated that 1 billion waste tires are generated every year across the globe, yet only 10% are being processed, and much rubber waste is yielded during manufacturing. These waste tires and rubber scraps are poisonous to the environment when processed via incineration and landfill. Rubber circular manufacturing is an effective solution that reduces not only rubber waste but also raw material costs. In this paper we propose a two-line flowshop model for the circular rubber manufacturing problem (CRMP), where the job sequence of two production lines is appropriately aligned to obtain the shortest makespan while guaranteeing that sufficient rubber waste yielded in the first line is ready to be reused for circular production in the second line. A genetic algorithm (GA) is developed, and the design of its genetic operations is customized to the CRMP context to achieve efficient and effective evolution. The experimental results with both real and synthetic datasets show that the GA significantly surpasses two heuristics in the literature by delivering the minimum makespan, which is 3.4 to 11.2% shorter than those obtained by the two competing methods.

Suggested Citation

  • Peng-Yeng Yin & Hsin-Min Chen & Yi-Lung Cheng & Ying-Chieh Wei & Ya-Lin Huang & Rong-Fuh Day, 2021. "Minimizing the Makespan in Flowshop Scheduling for Sustainable Rubber Circular Manufacturing," Sustainability, MDPI, vol. 13(5), pages 1-18, February.
    • Handle: RePEc:gam:jsusta:v:13:y:2021:i:5:p:2576-:d:507510
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/13/5/2576/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/13/5/2576/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Osman, IH & Potts, CN, 1989. "Simulated annealing for permutation flow-shop scheduling," Omega, Elsevier, vol. 17(6), pages 551-557.
    2. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages 630-637, June.
    3. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    4. Rocío González-Sánchez & Davide Settembre-Blundo & Anna Maria Ferrari & Fernando E. García-Muiña, 2020. "Main Dimensions in the Building of the Circular Supply Chain: A Literature Review," Sustainability, MDPI, vol. 12(6), pages 1-25, March.
    5. Omar Alhawari & Usama Awan & M. Khurrum S. Bhutta & M. Ali Ülkü, 2021. "Insights from Circular Economy Literature: A Review of Extant Definitions and Unravelling Paths to Future Research," Sustainability, MDPI, vol. 13(2), pages 1-22, January.
    6. Alessandro Fontana & Andrea Barni & Deborah Leone & Maurizio Spirito & Agata Tringale & Matteo Ferraris & Joao Reis & Gil Goncalves, 2021. "Circular Economy Strategies for Equipment Lifetime Extension: A Systematic Review," Sustainability, MDPI, vol. 13(3), pages 1-28, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rohit Agrawal & Vishal A. Wankhede & Anil Kumar & Sunil Luthra & Abhijit Majumdar & Yigit Kazancoglu, 2022. "An Exploratory State-of-the-Art Review of Artificial Intelligence Applications in Circular Economy using Structural Topic Modeling," Operations Management Research, Springer, vol. 15(3), pages 609-626, December.

    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. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    2. Vineet Jain & Tilak Raj, 2018. "An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1302-1314, December.
    3. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    4. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.
    5. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    6. Arshad Ali & Yuvraj Gajpal & Tarek Y. Elmekkawy, 2021. "Distributed permutation flowshop scheduling problem with total completion time objective," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 425-447, June.
    7. Asoo J. Vakharia & Yih‐Long Chang, 1990. "A simulated annealing approach to scheduling a manufacturing cell," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 559-577, August.
    8. Suliman, S. M. A., 2000. "A two-phase heuristic approach to the permutation flow-shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 143-152, March.
    9. Agarwal, Anurag & Colak, Selcuk & Eryarsoy, Enes, 2006. "Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach," European Journal of Operational Research, Elsevier, vol. 169(3), pages 801-815, March.
    10. Ruiz, Rubén & Maroto, Concepciøn & Alcaraz, Javier, 2006. "Two new robust genetic algorithms for the flowshop scheduling problem," Omega, Elsevier, vol. 34(5), pages 461-476, October.
    11. W Q Huang & L Wang, 2006. "A local search method for permutation flow shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1248-1251, October.
    12. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    13. Chu, Chengbin & Proth, Jean-Marie & Sethi, Suresh, 1995. "Heuristic procedures for minimizing makespan and the number of required pallets," European Journal of Operational Research, Elsevier, vol. 86(3), pages 491-502, November.
    14. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    15. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    16. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 2006. "Some aspects of scatter search in the flow-shop problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 654-666, March.
    17. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    18. A Corominas & R Pastor, 2011. "Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1704-1710, September.
    19. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    20. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.

    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:gam:jsusta:v:13:y:2021:i:5:p:2576-:d:507510. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.