IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v19y2016i1d10.1007_s10951-015-0459-4.html
   My bibliography  Save this article

MP or not MP: that is the question

Author

Listed:
  • Federico Della Croce

    (D.A.I. Politecnico di Torino
    CNR, IEIIT)

Abstract

It is well known that in the twentieth century, mathematical programming (MP) modeling and particularly linear programming (LP) modeling, even though strongly applied to combinatorial optimization, were not too successful when directed to scheduling problems. The purpose of this paper is to show that the field of successful applications of LP/MP modeling is still growing and includes also scheduling topics. We first focus on single machine scheduling. We consider a single machine scheduling model where a quadratic programming (QP) formulation handled by means of a QP solver is shown to be competitive with the state of the art approaches. Also, we discuss a single machine bicriterion scheduling problem and show that a standard LP formulation based on positional completion times performs reasonably well when handled by means of a LP solver. Then, we show how LP can be used to tighten bounds for approximation results in sequencing problems. Finally, we show how to enhance the complexity bounds of branch-and-reduce exact exponential algorithms by means of the so-called measure-and-conquer paradigm requiring always the solution of a specific MP model.

Suggested Citation

  • Federico Della Croce, 2016. "MP or not MP: that is the question," Journal of Scheduling, Springer, vol. 19(1), pages 33-42, February.
    • Handle: RePEc:spr:jsched:v:19:y:2016:i:1:d:10.1007_s10951-015-0459-4
    DOI: 10.1007/s10951-015-0459-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-015-0459-4
    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/s10951-015-0459-4?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. Atefeh Moghaddam & Lionel Amodeo & Farouk Yalaoui & Behrooz Karimi, 2012. "Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 3(2), pages 42-61, April.
    2. Christos H. Papadimitriou & Mihalis Yannakakis, 1993. "The Traveling Salesman Problem with Distances One and Two," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 1-11, February.
    3. M Azizoglu & M Koksalan & S K Koksalan, 2003. "Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 661-664, June.
    4. M'Hallah, Rym & Bulfin, R. L., 2003. "Minimizing the weighted number of tardy jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 145(1), pages 45-56, February.
    5. Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
    6. Blazewicz, Jacek & Dror, Moshe & Weglarz, Jan, 1991. "Mathematical programming formulations for machine scheduling: A survey," European Journal of Operational Research, Elsevier, vol. 51(3), pages 283-300, April.
    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. Renata Mansini & Roberto Zanotti, 2020. "Optimizing the physician scheduling problem in a large hospital ward," Journal of Scheduling, Springer, vol. 23(3), pages 337-361, June.

    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. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    2. E Duman & M H Ozcelik & A N Ceranoglu, 2005. "A TSP (1,2) application arising in cable assembly shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 642-648, June.
    3. Plastria, F., 2012. "A note towards improved homeland defense," Omega, Elsevier, vol. 40(2), pages 244-248, April.
    4. Jordan, Carsten & Drexl, Andreas, 1993. "A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 322, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
    6. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    7. Roe, R.A. & Smeelen, M. & Hoefeld, C., 2005. "Outsourcing and organizational change : an employee perspective," Research Memorandum 045, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Daniel Aloise & Pierre Hansen, 2011. "Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering," Journal of Global Optimization, Springer, vol. 49(3), pages 449-465, March.
    9. Danny Hermelin & Hendrik Molter & Dvir Shabtay, 2024. "Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 836-848, May.
    10. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    11. A. R. Rahimi-Vahed & S. M. Mirghorbani, 2007. "A multi-objective particle swarm for a flow shop scheduling problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 79-102, January.
    12. Martijn Ee & René Sitters, 2020. "The Chinese deliveryman problem," 4OR, Springer, vol. 18(3), pages 341-356, September.
    13. 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.
    14. Monnot, Jerome & Paschos, Vangelis Th. & Toulouse, Sophie, 2003. "Differential approximation results for the traveling salesman problem with distances 1 and 2," European Journal of Operational Research, Elsevier, vol. 145(3), pages 557-568, March.
    15. Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier, 2022. "Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times," Journal of Scheduling, Springer, vol. 25(1), pages 89-105, February.
    16. Wan, Guohua & Yen, Benjamin P.-C., 2009. "Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 195(1), pages 89-97, May.
    17. Kurowski, Krzysztof & Pecyna, Tomasz & Slysz, Mateusz & Różycki, Rafał & Waligóra, Grzegorz & Wȩglarz, Jan, 2023. "Application of quantum approximate optimization algorithm to job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 518-528.
    18. Bogdan Armaselu, 2023. "Approximation algorithms for some extensions of the maximum profit routing problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-22, January.
    19. Lotte Berghman & Roel Leus & Frits Spieksma, 2014. "Optimal solutions for a dock assignment problem with trailer transportation," Annals of Operations Research, Springer, vol. 213(1), pages 3-25, February.
    20. Mathias Weller & Annie Chateau & Rodolphe Giroudeau & Jean-Claude König & Valentin Pollet, 2018. "On residual approximation in solution extension problems," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1195-1220, November.

    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:jsched:v:19:y:2016:i:1:d:10.1007_s10951-015-0459-4. 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.