IDEAS home Printed from https://ideas.repec.org/a/ibn/ibrjnl/v10y2017i12p197-221.html

A Bi-objective Simulation-optimization Approach for Solving a No-wait two Stages Flexible Flow Shop Scheduling Problem with Rework Ability

Author

Listed:
  • Mohammad Rahmanidoust
  • Jianguo Zheng

Abstract

The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.

Suggested Citation

  • Mohammad Rahmanidoust & Jianguo Zheng, 2017. "A Bi-objective Simulation-optimization Approach for Solving a No-wait two Stages Flexible Flow Shop Scheduling Problem with Rework Ability," International Business Research, Canadian Center of Science and Education, vol. 10(12), pages 197-221, December.
    • Handle: RePEc:ibn:ibrjnl:v:10:y:2017:i:12:p:197-221
    as

    Download full text from publisher

    File URL: http://www.ccsenet.org/journal/index.php/ibr/article/view/70816/39298
    Download Restriction: no
    File URL: http://www.ccsenet.org/journal/index.php/ibr/article/view/70816
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    2. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    3. Zhou, Gengui & Min, Hokey & Gen, Mitsuo, 2003. "A genetic algorithm approach to the bi-criteria allocation of customers to warehouses," International Journal of Production Economics, Elsevier, vol. 86(1), pages 35-45, October.
    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. Michael Geurtsen & Jelle Adan & Alp Akçay, 2024. "Integrated maintenance and production scheduling for unrelated parallel machines with setup times," Flexible Services and Manufacturing Journal, Springer, vol. 36(3), pages 1046-1079, September.
    2. Pokharel, Shaligram, 2008. "A two objective model for decision making in a supply chain," International Journal of Production Economics, Elsevier, vol. 111(2), pages 378-388, February.
    3. Elias Olivares-Benitez & José González-Velarde & Roger Ríos-Mercado, 2012. "A supply chain design problem with facility location and bi-objective transportation choices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 729-753, October.
    4. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    5. Min, Hokey & Jeung Ko, Hyun & Seong Ko, Chang, 2006. "A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns," Omega, Elsevier, vol. 34(1), pages 56-69, January.
    6. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    7. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    8. Afshin Mansouri, S. & Gallear, David & Askariazad, Mohammad H., 2012. "Decision support for build-to-order supply chain management through multiobjective optimization," International Journal of Production Economics, Elsevier, vol. 135(1), pages 24-36.
    9. Ławrynowicz Anna, 2011. "Genetic Algorithms for Solving Scheduling Problems in Manufacturing Systems," Foundations of Management, Sciendo, vol. 3(2), pages 7-26, January.
    10. Maximilian Moser & Nysret Musliu & Andrea Schaerf & Felix Winter, 2022. "Exact and metaheuristic approaches for unrelated parallel machine scheduling," Journal of Scheduling, Springer, vol. 25(5), pages 507-534, October.
    11. J R Montoya-Torres & A Aponte & P Rosas, 2011. "Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 397-406, February.
    12. Maryam Shoaee & Parvaneh Samouei, 2024. "Clusters of floor locations-allocation of stores to cross-docking warehouse considering satisfaction and space using MOGWO and NSGA-II algorithms," Flexible Services and Manufacturing Journal, Springer, vol. 36(1), pages 315-342, March.
    13. Shuwan Zhu & Wenjuan Fan & Xueping Li & Shanlin Yang, 2023. "Ambulance dispatching and operating room scheduling considering reusable resources in mass-casualty incidents," Operational Research, Springer, vol. 23(2), pages 1-37, June.
    14. Finke, Gerd & Gara-Ali, Ahmed & Espinouse, Marie-Laure & Jost, Vincent & Moncel, Julien, 2017. "Unified matrix approach to solve production-maintenance problems on a single machine," Omega, Elsevier, vol. 66(PA), pages 140-146.
    15. Hongmin Li & Woonghee T. Huh & Matheus C. Sampaio & Naiping Keng, 2021. "Planning Production and Equipment Qualification under High Process Flexibility," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3369-3390, October.
    16. Jesús Isaac Vázquez-Serrano & Leopoldo Eduardo Cárdenas-Barrón & Rodrigo E. Peimbert-García, 2021. "Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem," Mathematics, MDPI, vol. 9(22), pages 1-34, November.
    17. Mojtaba Afzalirad & Masoud Shafipour, 2018. "Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 423-437, February.
    18. Yang-Kuei Lin & Yin-Yi Chou, 2020. "A hybrid genetic algorithm for operating room scheduling," Health Care Management Science, Springer, vol. 23(2), pages 249-263, June.
    19. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    20. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    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:ibn:ibrjnl:v:10:y:2017:i:12:p:197-221. 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    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.