IDEAS home Printed from https://ideas.repec.org/r/cor/louvrp/917.html
   My bibliography  Save this item

Formulating the single machine sequencing problem with release dates as a mixed integer program

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Ruben Hoeksma & Marc Uetz, 2016. "Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types," Operations Research, INFORMS, vol. 64(6), pages 1438-1450, December.
  2. Rachid Benmansour & Oliver Braun & Saïd Hanafi, 2019. "The single-processor scheduling problem with time restrictions: complexity and related problems," Journal of Scheduling, Springer, vol. 22(4), pages 465-471, August.
  3. Nesello, Vitor & Subramanian, Anand & Battarra, Maria & Laporte, Gilbert, 2018. "Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 266(2), pages 498-507.
  4. Esmaeilbeigi, Rasul & Charkhgard, Parisa & Charkhgard, Hadi, 2016. "Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations," European Journal of Operational Research, Elsevier, vol. 251(2), pages 419-431.
  5. Pereira, Jordi & Vásquez, Óscar C., 2017. "The single machine weighted mean squared deviation problem," European Journal of Operational Research, Elsevier, vol. 261(2), pages 515-529.
  6. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
  7. Dauzere-Peres, Stephane, 1995. "Minimizing late jobs in the general one machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 81(1), pages 134-142, February.
  8. Philippe Baptiste & Ruslan Sadykov, 2009. "On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 487-502, September.
  9. Leonardo Lamorgese & Carlo Mannino & Mauro Piacentini, 2016. "Optimal Train Dispatching by Benders’-Like Reformulation," Transportation Science, INFORMS, vol. 50(3), pages 910-925, August.
  10. van den Akker, J.M. & Savelsbergh, M.W.P. & van Hoesel, C.P.M., 1997. "A polyhedral approach to single-machine scheduling problems," Research Memorandum 002, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  11. Stéphane Dauzère-Pérès & Sigrid Lise Nonås, 2023. "An improved decision support model for scheduling production in an engineer-to-order manufacturer," 4OR, Springer, vol. 21(2), pages 247-300, June.
  12. Hui Liu & Maurice Queyranne & David Simchi‐Levi, 2005. "On the asymptotic optimality of algorithms for the flow shop problem with release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(3), pages 232-242, April.
  13. Leonardo Lamorgese & Carlo Mannino, 2015. "An Exact Decomposition Approach for the Real-Time Train Dispatching Problem," Operations Research, INFORMS, vol. 63(1), pages 48-64, February.
  14. Kerem Bülbül & Philip Kaminsky & Candace Yano, 2004. "Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 407-445, April.
  15. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2010. "GUB Covers and Power-Indexed Formulations for Wireless Network Design," DIS Technical Reports 2010-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  16. José Manuel García-Sánchez & Plácido Moreno, 2024. "Novel Approaches to the Formulation of Scheduling Problems," Mathematics, MDPI, vol. 12(7), pages 1-15, March.
  17. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
  18. Leonardo Lamorgese & Carlo Mannino, 2019. "A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management," Operations Research, INFORMS, vol. 67(6), pages 1586-1609, November.
  19. Heidt, Andreas & Helmke, Hartmut & Kapolke, Manu & Liers, Frauke & Martin, Alexander, 2016. "Robust runway scheduling under uncertain conditions," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 28-37.
  20. Soric, Kristina, 2000. "The CLWS heuristic for single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 352-358, January.
  21. Yunpeng Pan & Zhe Liang, 2017. "Dual relaxations of the time-indexed ILP formulation for min–sum scheduling problems," Annals of Operations Research, Springer, vol. 249(1), pages 197-213, February.
  22. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
  23. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
  24. Tjark Vredeveld & Cor Hurkens, 2002. "Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 175-189, May.
  25. 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.
  26. Arthur Kramer & Anand Subramanian, 2019. "A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems," Journal of Scheduling, Springer, vol. 22(1), pages 21-57, February.
  27. Pasquale Avella & Maurizio Boccia & Bernardo D’Auria, 2005. "Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 183-191, May.
  28. Soric, Kristina, 2000. "A cutting plane algorithm for a single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 383-393, December.
  29. José R. Correa & Andreas S. Schulz, 2005. "Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 1005-1021, November.
  30. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
  31. J.M. van den Akker & C.A.J. Hurkens & M.W.P. Savelsbergh, 2000. "Time-Indexed Formulations for Machine Scheduling Problems: Column Generation," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 111-124, May.
  32. Giuseppe Lancia & Franca Rinaldi & Paolo Serafini, 2011. "A time-indexed LP-based approach for min-sum job-shop problems," Annals of Operations Research, Springer, vol. 186(1), pages 175-198, June.
  33. Kerem Bülbül & Halil Şen, 2017. "An exact extended formulation for the unrelated parallel machine total weighted completion time problem," Journal of Scheduling, Springer, vol. 20(4), pages 373-389, August.
  34. Fabio D'Andreagiovanni & Carlo Mannino & Antonio Sassano, 2009. "A Power-Indexed Formulation for Wireless Network Design," DIS Technical Reports 2009-14, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  35. 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.
  36. Prahalad Venkateshan & Joseph Szmerekovsky & George Vairaktarakis, 2020. "A cutting plane approach for the multi-machine precedence-constrained scheduling problem," Annals of Operations Research, Springer, vol. 285(1), pages 247-271, February.
  37. Martin W. P. Savelsbergh & R. N. Uma & Joel Wein, 2005. "An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 123-136, February.
  38. Daniel Kowalczyk & Roel Leus, 2018. "A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 768-782, November.
  39. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
  40. Maria Fleischer Fauske & Carlo Mannino & Paolo Ventura, 2020. "Generalized Periodic Vehicle Routing and Maritime Surveillance," Transportation Science, INFORMS, vol. 54(1), pages 164-183, January.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.