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. 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.
    3. 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.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Jun-Ho Lee & Hyun-Jung Kim, 2021. "A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 992-1026, December.
    6. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    7. Luo, Wenchang & Liu, Feng, 2017. "On single-machine scheduling with workload-dependent maintenance duration," Omega, Elsevier, vol. 68(C), pages 119-122.
    8. F. Angel-Bello & Y. Cardona-Valdés & A. Álvarez, 2019. "Mixed integer formulations for the multiple minimum latency problem," Operational Research, Springer, vol. 19(2), pages 369-398, June.
    9. Felipe Campelo & Fernanda Takahashi, 2019. "Sample size estimation for power and accuracy in the experimental comparison of algorithms," Journal of Heuristics, Springer, vol. 25(2), pages 305-338, April.
    10. Mansouri, S. Afshin & Aktas, Emel & Besikci, Umut, 2016. "Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption," European Journal of Operational Research, Elsevier, vol. 248(3), pages 772-788.
    11. Perea, Federico & Yepes-Borrero, Juan C. & Menezes, Mozart B.C., 2023. "Acceptance Ordering Scheduling Problem: The impact of an order-portfolio on a make-to-order firm’s profitability," International Journal of Production Economics, Elsevier, vol. 264(C).
    12. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2018. "A new methodology for the open-pit mine production scheduling problem," Omega, Elsevier, vol. 81(C), pages 169-182.
    13. Kai Li & Fulong Xie & Jianfu Chen & Wei Xiao & Tao Zhou, 2025. "Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(1), pages 129-176, March.
    14. Guo, Z.X. & Ngai, E.W.T. & Yang, Can & Liang, Xuedong, 2015. "An RFID-based intelligent decision support system architecture for production monitoring and scheduling in a distributed manufacturing environment," International Journal of Production Economics, Elsevier, vol. 159(C), pages 16-28.
    15. Felipe Campelo & Elizabeth F. Wanner, 2020. "Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances," Journal of Heuristics, Springer, vol. 26(6), pages 851-883, December.
    16. Mensendiek, Arne & Gupta, Jatinder N.D. & Herrmann, Jan, 2015. "Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 243(2), pages 514-522.
    17. Li, Zhaolong & Jin, Chun & Hu, Pan & Wang, Cong, 2019. "Resilience-based transportation network recovery strategy during emergency recovery phase under uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 503-514.
    18. Rolim, Gustavo Alencar & Tomazella, Caio Paziani & Nagano, Marcelo Seido, 2025. "On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups," European Journal of Operational Research, Elsevier, vol. 326(2), pages 220-233.
    19. Peihai Liu & Manzhan Gu & Xiwen Lu, 2025. "Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities," Journal of Scheduling, Springer, vol. 28(4), pages 391-406, August.
    20. Shuwan Zhu & Wenjuan Fan & Tongzhu Liu & Shanlin Yang & Panos M. Pardalos, 2020. "Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 185-215, January.

    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.