An efficient ILP formulation for the single machine scheduling problem
From MaRDI portal
Publication:5189883
DOI10.1051/ro/2010007zbMath1183.90161OpenAlexW2155938357MaRDI QIDQ5189883
Brahim Bouzouia, Cyril Briand, Samia Ourari
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
Related Items
Integrated production and outbound distribution scheduling problems with job release dates and deadlines ⋮ An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints ⋮ Jackson's semi-preemptive scheduling on a single machine
Cites Work
- Unnamed Item
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
- 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