An efficient ILP formulation for the single machine scheduling problem
From MaRDI portal
Publication:5189883
DOI10.1051/RO/2010007zbMATH Open1183.90161OpenAlexW2155938357MaRDI QIDQ5189883FDOQ5189883
Authors: Cyril Briand, Samia Ourari, Brahim Bouzouia 
Publication date: 11 March 2010
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/44710
Recommendations
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- A time indexed formulation of non-preemptive single machine scheduling problems
- A mixed integer programming approach for the single machine problem with unequal release dates
- Minimization of the maximal lateness for a single machine
- Near-optimal solutions of large-scale single-machine scheduling problems
Cites Work
- Title not available (Why is that?)
- The one-machine sequencing problem
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
Cited In (5)
- Jackson's semi-preemptive scheduling on a single machine
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
This page was built for publication: An efficient ILP formulation for the single machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189883)
