IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v267y2018i1d10.1007_s10479-018-2775-5.html
   My bibliography  Save this article

Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic

Author

Listed:
  • E. Dhouib

    (Unité de recherche LOgistique Gestion Industrielle et de la Qualité (LOGIQ), Institut Supérieur de Gestion Industrielle de Sfax, Université de Sfax)

  • J. Teghem

    (Service de Mathématique et de Recherche Opérationnelle (MathRO), Université de Mons/Faculté Polytechnique)

  • T. Loukil

    (Unité de recherche LOgistique Gestion Industrielle et de la Qualité (LOGIQ), Institut Supérieur de Gestion Industrielle de Sfax, Université de Sfax)

Abstract

In this paper, we address the non-permutation flowshop scheduling problem with minimal and maximal time lags between successive operations of each job. For this problem, the set of permutation schedules is not a dominant set but not all non-permutation schedules are feasible because they are not always able to satisfy all time lag constraints. We present a theoretical study, limited to the two-machine case, and related to the change on one machine of the order of two successive jobs of a permutation schedule. This study gives first the necessary conditions to make such move with regard to the feasibility of the schedule; secondly the necessary conditions to make such move interesting with regard to either the makespan or the number of tardy jobs. Through this analysis, we obtain new properties of dominance of permutation schedules. The results of the study are incorporated into a heuristic algorithm which starts the search with optimal permutation schedules and tries to improve them so as to obtain better non-permutation schedules. We also propose a mixed integer linear programming model. The objective function is to minimize lexicographically the number of tardy jobs as primary criterion and the makespan as secondary one. Computational experiments are performed to compare permutation with non-permutation schedules.

Suggested Citation

  • E. Dhouib & J. Teghem & T. Loukil, 2018. "Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic," Annals of Operations Research, Springer, vol. 267(1), pages 101-134, August.
    • Handle: RePEc:spr:annopr:v:267:y:2018:i:1:d:10.1007_s10479-018-2775-5
    DOI: 10.1007/s10479-018-2775-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2775-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-2775-5?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. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
    2. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    3. Hariri, A. M. A. & Potts, C. N., 1989. "A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop," European Journal of Operational Research, Elsevier, vol. 38(2), pages 227-226, January.
    4. Neppalli, Venkata Ranga & Chen, Chuen-Lung & Gupta, Jatinder N. D., 1996. "Genetic algorithms for the two-stage bicriteria flowshop problem," European Journal of Operational Research, Elsevier, vol. 95(2), pages 356-373, December.
    5. Demirkol, Ebru & Mehta, Sanjay & Uzsoy, Reha, 1998. "Benchmarks for shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 109(1), pages 137-141, August.
    6. Imen Hamdi & Ammar Oulamara & Taïcir Loukil, 2015. "A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 23(4), pages 387-405.
    7. Mehravaran, Yasaman & Logendran, Rasaratnam, 2012. "Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 135(2), pages 953-963.
    8. Peter Brucker & Sigrid Knust & T.C. Cheng & Natalia Shakhlevich, 2004. "Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays," Annals of Operations Research, Springer, vol. 129(1), pages 81-106, July.
    9. Fondrevelle, J. & Oulamara, A. & Portmann, M.-C., 2008. "Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times," International Journal of Production Economics, Elsevier, vol. 112(1), pages 168-176, March.
    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. Mohamed Amine Mkadem & Aziz Moukrim & Mehdi Serairi, 2021. "Exact method for the two-machine flow-shop problem with time delays," Annals of Operations Research, Springer, vol. 298(1), pages 375-406, March.

    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. Lemesre, J. & Dhaenens, C. & Talbi, E.G., 2007. "An exact parallel method for a bi-objective permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1641-1655, March.
    2. Rossit, Daniel Alejandro & Tohmé, Fernando & Frutos, Mariano, 2018. "The Non-Permutation Flow-Shop scheduling problem: A literature review," Omega, Elsevier, vol. 77(C), pages 143-153.
    3. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    4. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    5. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    6. Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan, 0. "Multiprocessor open shop problem: literature review and future directions," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    7. Andrzej Bożek, 2020. "Energy Cost-Efficient Task Positioning in Manufacturing Systems," Energies, MDPI, vol. 13(19), pages 1-21, September.
    8. Framinan, Jose M. & Leisten, Rainer & Ruiz-Usano, Rafael, 2002. "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," European Journal of Operational Research, Elsevier, vol. 141(3), pages 559-569, September.
    9. Gupta, Jatinder N. D. & Neppalli, Venkata R. & Werner, Frank, 2001. "Minimizing total flow time in a two-machine flowshop problem with minimum makespan," International Journal of Production Economics, Elsevier, vol. 69(3), pages 323-338, February.
    10. Bahman Naderi & Rubén Ruiz & Vahid Roshanaei, 2023. "Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 817-843, July.
    11. Jelke J. Hoorn, 2018. "The Current state of bounds on benchmark instances of the job-shop scheduling problem," Journal of Scheduling, Springer, vol. 21(1), pages 127-128, February.
    12. Arroyo, Jose Elias Claudio & Armentano, Vinicius Amaral, 2005. "Genetic local search for multi-objective flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 167(3), pages 717-738, December.
    13. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    14. Geiger, Martin Josef, 2007. "On operators and search space topology in multi-objective flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 181(1), pages 195-206, August.
    15. Yannik Zeiträg & José Rui Figueira, 2023. "Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling," Journal of Scheduling, Springer, vol. 26(3), pages 289-314, June.
    16. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    17. T'kindt, Vincent & Monmarche, Nicolas & Tercinet, Fabrice & Laugt, Daniel, 2002. "An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 250-257, October.
    18. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    19. Figueira, J.R. & Liefooghe, A. & Talbi, E.-G. & Wierzbicki, A.P., 2010. "A parallel multiple reference point approach for multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 205(2), pages 390-400, September.
    20. Mejía, Gonzalo & Yuraszeck, Francisco, 2020. "A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times," European Journal of Operational Research, Elsevier, vol. 285(2), pages 484-496.

    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:spr:annopr:v:267:y:2018:i:1:d:10.1007_s10479-018-2775-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.