IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v21y2013i4p729-744.html
   My bibliography  Save this article

New effective MILP models for PFSPs arising from real applications

Author

Listed:
  • Tamás Hajba
  • Zoltán Horváth

Abstract

Permutation flow shop problems (PFSPs) with makespan minimization that model production lines working in industry often have some special features: they are typically large-scale and the jobs can be sorted into types so that jobs of the same type have equal processing time values at each machine. We define the related R-PFSP, the Permutation with Repetition Flow Shop Problem, which is of less complexity if the number of types is bounded. Moreover, a subproblem set of R-PFSPs, the RL-PFSP is considered too, where only those permutations are in the design space in which subsequent tuples of a certain size contain jobs of the same type. We construct adequate new MILP models for R-PFSPs and RL-PFSPs and investigate their effectiveness experimentally. We demonstrate that via our new MILP models significantly larger problems can be solved than via the classical MILP models. Copyright Springer-Verlag 2013

Suggested Citation

  • Tamás Hajba & Zoltán Horváth, 2013. "New effective MILP models for PFSPs arising from real applications," 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. 21(4), pages 729-744, December.
    • Handle: RePEc:spr:cejnor:v:21:y:2013:i:4:p:729-744
    DOI: 10.1007/s10100-012-0263-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-012-0263-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-012-0263-6?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. Tseng, Fan T. & Stafford, Edward F. & Gupta, Jatinder N. D., 2004. "An empirical analysis of integer programming formulations for the permutation flowshop," Omega, Elsevier, vol. 32(4), pages 285-293, August.
    2. Stafford, Edward F. & Tseng, Fan T., 2002. "Two models for a family of flowshop sequencing problems," European Journal of Operational Research, Elsevier, vol. 142(2), pages 282-293, October.
    3. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    4. E F Stafford & F T Tseng & J N D Gupta, 2005. "Comparative evaluation of MILP flowshop models," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(1), pages 88-101, January.
    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. Tibor Csendes & Tibor Jordán & Tamás Szántai, 2013. "Editorial," 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. 21(4), pages 663-664, December.
    2. Tamás Hajba & Zoltán Horváth, 2015. "MILP models for the optimization of real production lines," 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. 23(4), pages 899-912, December.

    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. Tamás Hajba & Zoltán Horváth, 2015. "MILP models for the optimization of real production lines," 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. 23(4), pages 899-912, December.
    2. 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.
    3. Mostafa Khatami & Seyed Hessameddin Zegordi, 2017. "Coordinative production and maintenance scheduling problem with flexible maintenance time intervals," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 857-867, April.
    4. Vallada, Eva & Ruiz, Rubén, 2009. "Cooperative metaheuristics for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 365-376, March.
    5. K Sheibani, 2010. "A fuzzy greedy heuristic for permutation flow-shop scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 813-818, May.
    6. F T Tseng & E F Stafford, 2008. "New MILP models for the permutation flowshop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1373-1386, October.
    7. 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.
    8. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    9. Naderi, B. & Zandieh, M., 2014. "Modeling and scheduling no-wait open shop problems," International Journal of Production Economics, Elsevier, vol. 158(C), pages 256-266.
    10. Ruiz, Ruben & Stutzle, Thomas, 2008. "An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1143-1159, June.
    11. Rad, Shahriar Farahmand & Ruiz, Rubén & Boroojerdian, Naser, 2009. "New high performing heuristics for minimizing makespan in permutation flowshops," Omega, Elsevier, vol. 37(2), pages 331-345, April.
    12. Shahaboddin Shamshirband & Mohammad Shojafar & A. Hosseinabadi & Maryam Kardgar & M. Nasir & Rodina Ahmad, 2015. "OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 743-758, June.
    13. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    14. Pempera, Jaroslaw & Smutnicki, Czeslaw, 2018. "Open shop cyclic scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 773-781.
    15. 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.
    16. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    17. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    18. Nouha Nouri & Talel Ladhari, 2018. "Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking," Annals of Operations Research, Springer, vol. 267(1), pages 413-430, August.
    19. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
    20. Pflughoeft, K. A. & Hutchinson, G. K. & Nazareth, D. L., 1996. "Intelligent decision support for flexible manufacturing: Design and implementation of a knowledge-based simulator," Omega, Elsevier, vol. 24(3), pages 347-360, June.

    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:cejnor:v:21:y:2013:i:4:p:729-744. 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.