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

Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint

Author

Listed:
  • Li, Zhan-tao
  • Chen, Qing-xin
  • Mao, Ning
  • Wang, Xiaoming
  • Liu, Jianjun

Abstract

This paper considers a two-stage flexible flow shop scheduling problem with task tail group constraint, where the two stages are made up of unrelated parallel machines. The objective is to find a schedule to minimize the total tardiness of jobs. For this problem, a mathematical model is formulated. Through analyzing this kind of problem, it is proved to be NP-hard and an advantage scheduling rule is proposed. According to the advantage scheduling rule, a new heuristic method called EL algorithm, is designed to solve this problem. From the theoretical analysis of EL algorithm, we provide EL algorithm with the time complexity and worst-case analysis. To test the performance of EL algorithm, a computational experiment is designed. In the computational experiment, both the twelve dispatching rules based on the literatures and EL algorithm are applied to the benchmark instances. Simulation results indicate that LPT–CDS, SPT–Pal, SPT–CDS and EL algorithms are effective and EL algorithm outperforms the other twelve dispatching rules with respect to the two-stage flexible flow shop scheduling problem proposed in this paper.

Suggested Citation

  • Li, Zhan-tao & Chen, Qing-xin & Mao, Ning & Wang, Xiaoming & Liu, Jianjun, 2013. "Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint," International Journal of Production Economics, Elsevier, vol. 146(2), pages 667-678.
    • Handle: RePEc:eee:proeco:v:146:y:2013:i:2:p:667-678
    DOI: 10.1016/j.ijpe.2013.08.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527313003757
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2013.08.020?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. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    2. Almeder, Christian & Hartl, Richard F., 2013. "A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer," International Journal of Production Economics, Elsevier, vol. 145(1), pages 88-95.
    3. Logendran, Rasaratnam & Nudtasomboon, Nudtapon, 1991. "Minimizing the makespan of a group scheduling problem: a new heuristic," International Journal of Production Economics, Elsevier, vol. 22(3), pages 217-230, December.
    4. Brah, Shaukat A. & Loo, Luan Luan, 1999. "Heuristics for scheduling in a flow shop with multiple processors," European Journal of Operational Research, Elsevier, vol. 113(1), pages 113-122, February.
    5. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    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. Marco Schulze & Julia Rieck & Cinna Seifi & Jürgen Zimmermann, 2016. "Machine scheduling in underground mining: an application in the potash industry," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 365-403, March.
    2. Gerstl, Enrique & Mosheiov, Gur, 2014. "A two-stage flexible flow shop problem with unit-execution-time jobs and batching," International Journal of Production Economics, Elsevier, vol. 158(C), pages 171-178.

    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. Anzhen Peng & Longcheng Liu & Weifeng Lin, 2021. "Improved approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 28-42, January.
    2. Jin, Zhihong & Yang, Zan & Ito, Takahiro, 2006. "Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 100(2), pages 322-334, April.
    3. Chou, Fuh-Der, 2013. "Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks," International Journal of Production Economics, Elsevier, vol. 141(1), pages 137-145.
    4. Minghui Zhang & Yan Lan & Xin Han, 2020. "Approximation algorithms for two-stage flexible flow shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 1-14, January.
    5. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    6. Solimanpur, M. & Vrat, Prem & Shankar, Ravi, 2004. "A heuristic to minimize makespan of cell scheduling problem," International Journal of Production Economics, Elsevier, vol. 88(3), pages 231-241, April.
    7. L Tang & H Xuan, 2006. "Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 316-324, March.
    8. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    9. Lin, Hung-Tso & Lee, Hong-Tau & Pan, Wen-Jung, 2008. "Heuristics for scheduling in a no-wait open shop with movable dedicated machines," International Journal of Production Economics, Elsevier, vol. 111(2), pages 368-377, February.
    10. Ghorbanzadeh, Masoumeh & Ranjbar, Mohammad, 2023. "Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints," European Journal of Operational Research, Elsevier, vol. 307(2), pages 519-537.
    11. Torabi, S.A. & Fatemi Ghomi, S.M.T. & Karimi, B., 2006. "A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains," European Journal of Operational Research, Elsevier, vol. 173(1), pages 173-189, August.
    12. A Allahverdi & F S Al-Anzi, 2006. "Scheduling multi-stage parallel-processor services to minimize average response time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 101-110, January.
    13. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    14. 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.
    15. Hadda, Hatem & Dridi, Najoua & Hajji, Mohamed Karim, 2018. "On the optimality conditions of the two-machine flow shop problem," European Journal of Operational Research, Elsevier, vol. 266(2), pages 426-435.
    16. Nekoiemehr, Nooshin & Selvarajah, Esaignani & Zhang, Guoqing, 2015. "Scheduling of jobs with cross families in two stage manufacturing systems," International Journal of Production Economics, Elsevier, vol. 167(C), pages 88-96.
    17. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    18. Hejer Khlif Hachicha & Farah Zeghal Mansour, 2018. "Two-MILP models for scheduling elective surgeries within a private healthcare facility," Health Care Management Science, Springer, vol. 21(3), pages 376-392, September.
    19. Xiong, Fuli & Xing, Keyi & Wang, Feng, 2015. "Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 240(2), pages 338-354.
    20. Kuo, Yiyo & Yang, Taho & Cho, Chiwoon & Tseng, Yao-Ching, 2008. "Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 78(1), pages 40-56.

    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:146:y:2013:i:2:p:667-678. 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.