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

Hybrid Flow-Shop Scheduling Problems with Missing and Re-Entrant Operations Considering Process Scheduling and Production of Energy Consumption

Author

Listed:
  • Hongtao Tang

    (Institute of Industrial Engineering, College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Jiahao Zhou

    (Institute of Industrial Engineering, College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Yiping Shao

    (Institute of Industrial Engineering, College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Zhixiong Yang

    (Jiaxing Sudoku Bridge Technology Co., Ltd., Jiaxing 314599, China)

Abstract

A hybrid flow shop scheduling model with missing and re-entrant operations was designed to minimize the maximum completion time and the reduction in energy consumption. The proposed dual-population genetic algorithm was enhanced with a range of improvements, which include the design of a three-layer gene coding method, hierarchical crossover and mutation techniques, and the development of an adaptive operator that considered gene similarity and chromosome fitness values. The optimal and worst individuals were exchanged between the two subpopulations to improve the exploration ability of the algorithm. An orthogonal experiment was performed to obtain the optimal horizontal parameter set of the algorithm. Furthermore, an experiment was conducted to compare the proposed algorithm with a basic genetic algorithm, particle swarm optimization algorithm, and ant colony optimization, which were all performed on the same scale. The experimental results show that the fitness value of the proposed algorithm is above 15% stronger than the other 4 algorithms on a small scale, and was more than 10% stronger than the other 4 algorithms on a medium and large scale. Under the condition close to the actual scale, the results of ten repeated calculations showed that the proposed algorithm had higher robustness.

Suggested Citation

  • Hongtao Tang & Jiahao Zhou & Yiping Shao & Zhixiong Yang, 2023. "Hybrid Flow-Shop Scheduling Problems with Missing and Re-Entrant Operations Considering Process Scheduling and Production of Energy Consumption," Sustainability, MDPI, vol. 15(10), pages 1-19, May.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:10:p:7982-:d:1146268
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/10/7982/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/10/7982/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. W. Qin & J. Zhang & D. Song, 2018. "An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 891-904, April.
    2. Hamidreza Eskandari & Amirhamed Hosseinzadeh, 2014. "A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(8), pages 1221-1231, August.
    3. M.K. Marichelvam & T. Prabaharan, 2014. "Performance evaluation of an improved hybrid genetic scatter search (IHGSS) algorithm for multistage hybrid flow shop scheduling problems with missing operations," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 16(1), pages 120-141.
    4. Xiang Yi Zhang & Lu Chen, 2018. "A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 56(16), pages 5293-5305, August.
    5. S. M. Mousavi & I. Mahdavi & J. Rezaeian & M. Zandieh, 2018. "An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times," Operational Research, Springer, vol. 18(1), pages 123-158, April.
    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. Maedeh Fasihi & Reza Tavakkoli-Moghaddam & Fariborz Jolai, 2023. "A bi-objective re-entrant permutation flow shop scheduling problem: minimizing the makespan and maximum tardiness," Operational Research, Springer, vol. 23(2), pages 1-41, June.
    2. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    3. Wenjuan Fan & Yi Wang & Tongzhu Liu & Guixian Tong, 2020. "A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA–VNS algorithm," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 547-580, February.
    4. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
    5. Neufeld, Janis S. & Schulz, Sven & Buscher, Udo, 2023. "A systematic review of multi-objective hybrid flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 309(1), pages 1-23.
    6. Tomoko Sakiyama & Ikuo Arizono, 2018. "Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem," Complexity, Hindawi, vol. 2018, pages 1-5, December.
    7. Mingxing Li & Ray Y. Zhong & Ting Qu & George Q. Huang, 2022. "Spatial–temporal out-of-order execution for advanced planning and scheduling in cyber-physical factories," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1355-1372, June.
    8. Hongliang Zhang & Yujuan Wu & Ruilin Pan & Gongjie Xu, 2021. "Two-stage parallel speed-scaling machine scheduling under time-of-use tariffs," Journal of Intelligent Manufacturing, Springer, vol. 32(1), pages 91-112, January.
    9. Máté Hegyháti & Krisztián Attila Bakon & Tibor Holczinger, 2023. "Optimization with uncertainties: a scheduling example," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(4), pages 1239-1263, December.
    10. Julio Mar-Ortiz & Alex J. Ruiz Torres & Belarmino Adenso-Díaz, 2022. "Scheduling in parallel machines with two objectives: analysis of factors that influence the Pareto frontier," Operational Research, Springer, vol. 22(4), pages 4585-4605, September.
    11. Chen Peng & Tao Peng & Yi Zhang & Renzhong Tang & Luoke Hu, 2018. "Minimising Non-Processing Energy Consumption and Tardiness Fines in a Mixed-Flow Shop," Energies, MDPI, vol. 11(12), pages 1-15, December.
    12. Yankai Wang & Shilong Wang & Bo Yang & Bo Gao & Sibao Wang, 2022. "An effective adaptive adjustment method for service composition exception handling in cloud manufacturing," Journal of Intelligent Manufacturing, Springer, vol. 33(3), pages 735-751, March.
    13. Zheng, Meimei & Ye, Hongqing & Wang, Dong & Pan, Ershun, 2021. "Joint Optimization of Condition-Based Maintenance and Spare Parts Orders for Multi-Unit Systems with Dual Sourcing," Reliability Engineering and System Safety, Elsevier, vol. 210(C).

    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:15:y:2023:i:10:p:7982-:d:1146268. 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.