IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v244y2015i3p766-777.html
   My bibliography  Save this article

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem

Author

Listed:
  • Catanzaro, Daniele
  • Gouveia, Luis
  • Labbé, Martine

Abstract

In this article we investigate the job Sequencing and tool Switching Problem (SSP), a NP-hard combinatorial optimization problem arising from computer and manufacturing systems. Starting from the results described in Tang and Denardo (1987), Crama et al. (1994) and Laporte et al. (2004), we develop new integer linear programming formulations for the problem that are provably better than the alternative ones currently described in the literature. Computational experiments show that the lower bounds obtained by the linear relaxation of the considered formulations improve, on average, upon those currently described in the literature and suggest, at the same time, new directions for the development of future exact solution approaches.

Suggested Citation

  • Catanzaro, Daniele & Gouveia, Luis & Labbé, Martine, 2015. "Improved integer linear programming formulations for the job Sequencing and tool Switching Problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 766-777.
    • Handle: RePEc:eee:ejores:v:244:y:2015:i:3:p:766-777
    DOI: 10.1016/j.ejor.2015.02.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715001198
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.02.018?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. Ann E. Gray & Abraham Seidmann & Kathryn E. Stecke, 1993. "A Synthesis of Decision Models for Tool Management in Automated Manufacturing," Management Science, INFORMS, vol. 39(5), pages 549-567, May.
    2. Crama, Yves & Moonen, Linda S. & Spieksma, Frits C.R. & Talloen, Ellen, 2007. "The tool switching problem revisited," European Journal of Operational Research, Elsevier, vol. 182(2), pages 952-957, October.
    3. Blazewicz, Jacek & Finke, Gerd, 1994. "Scheduling with resource management in manufacturing systems," European Journal of Operational Research, Elsevier, vol. 76(1), pages 1-14, July.
    4. Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
    5. Caroline Privault & Gerd Finke, 2000. "k-server problems with bulk requests: an application to tool switching in manufacturing," Annals of Operations Research, Springer, vol. 96(1), pages 255-269, 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. Shehadeh, Karmel S. & Cohn, Amy E.M. & Epelman, Marina A., 2019. "Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 721-731.
    2. Beezão, Andreza Cristina & Cordeau, Jean-François & Laporte, Gilbert & Yanasse, Horacio Hideki, 2017. "Scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 257(3), pages 834-844.
    3. Szkatuła, Krzysztof, 2017. "Impact of deadline intervals on behavior of solutions to the random Sequencing Jobs with Deadlines problem," European Journal of Operational Research, Elsevier, vol. 262(1), pages 40-45.
    4. Akhundov, Najmaddin & Ostrowski, James, 2024. "Exploiting symmetry for the job sequencing and tool switching problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 976-987.
    5. Furrer, Martina & Mütze, Torsten, 2017. "An algorithmic framework for tool switching problems with multiple objectives," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1003-1016.
    6. Khadija Hadj Salem & Vincent Jost & Yann Kieffer & Luc Libralesso & Stéphane Mancini, 2022. "Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance," Operational Research, Springer, vol. 22(3), pages 1639-1673, July.
    7. Dang, Quang-Vinh & van Diessen, Thijs & Martagan, Tugce & Adan, Ivo, 2021. "A matheuristic for parallel machine scheduling with tool replacements," European Journal of Operational Research, Elsevier, vol. 291(2), pages 640-660.

    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. Furrer, Martina & Mütze, Torsten, 2017. "An algorithmic framework for tool switching problems with multiple objectives," European Journal of Operational Research, Elsevier, vol. 259(3), pages 1003-1016.
    2. Yves Crama & Joris van de Klundert, 1999. "Worst‐case performance of approximation algorithms for tool management problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 445-462, August.
    3. Calmels, Dorothea, 2022. "An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines," European Journal of Operational Research, Elsevier, vol. 297(1), pages 66-85.
    4. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    5. Konak, Abdullah & Kulturel-Konak, Sadan & Azizoglu, Meral, 2008. "Minimizing the number of tool switching instants in Flexible Manufacturing Systems," International Journal of Production Economics, Elsevier, vol. 116(2), pages 298-307, December.
    6. Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
    7. Raduly-Baka, Csaba & Nevalainen, Olli S., 2015. "The modular tool switching problem," European Journal of Operational Research, Elsevier, vol. 242(1), pages 100-106.
    8. Beezão, Andreza Cristina & Cordeau, Jean-François & Laporte, Gilbert & Yanasse, Horacio Hideki, 2017. "Scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 257(3), pages 834-844.
    9. Akturk, M. Selim & Ghosh, Jay B. & Gunes, Evrim D., 2004. "Scheduling with tool changes to minimize total completion time: Basic results and SPT performance," European Journal of Operational Research, Elsevier, vol. 157(3), pages 784-790, September.
    10. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    11. Cavory, G. & Dupas, R. & Goncalves, G., 2005. "A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints," European Journal of Operational Research, Elsevier, vol. 161(1), pages 73-85, February.
    12. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. Paul, Henrik J. & Bierwirth, Christian & Kopfer, Herbert, 2007. "A heuristic scheduling procedure for multi-item hoist production lines," International Journal of Production Economics, Elsevier, vol. 105(1), pages 54-69, January.
    14. Akhundov, Najmaddin & Ostrowski, James, 2024. "Exploiting symmetry for the job sequencing and tool switching problem," European Journal of Operational Research, Elsevier, vol. 316(3), pages 976-987.
    15. Crama Yves & Klundert Joris van de, 1996. "The approximability of tool management problems," Research Memorandum 019, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    16. George Polak, 2005. "On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices," Annals of Operations Research, Springer, vol. 138(1), pages 223-233, September.
    17. Patrick H. Liu, 2000. "A comparative study of three tool replacement/operation sequencing strategies in a flexible manufacturing system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(6), pages 479-499, September.
    18. Matzliach, Barouch & Tzur, Michal, 2000. "Storage management of items in two levels of availability," European Journal of Operational Research, Elsevier, vol. 121(2), pages 363-379, March.
    19. Güller, Mustafa & Hegmanns, Tobias & Henke, Michael & Straub, Natalia, 2014. "A Simulation-Based Decision Making Framework for the Anticipatory Change Planning of Intralogistics Systems," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Blecker, Thorsten & Kersten, Wolfgang & Ringle, Christian M. (ed.), Innovative Methods in Logistics and Supply Chain Management: Current Issues and Emerging Practices. Proceedings of the Hamburg International Conferenc, volume 19, pages 201-224, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    20. Soukhal, A. & Martineau, P., 2005. "Resolution of a scheduling problem in a flowshop robotic cell," European Journal of Operational Research, Elsevier, vol. 161(1), pages 62-72, February.

    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:ejores:v:244:y:2015:i:3:p:766-777. 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/eor .

    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.