An efficient ILP formulation for the single machine scheduling problem
From MaRDI portal
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
- A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Characterizing the set of feasible sequences for n jobs to be carried out on a single machine
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- The one-machine sequencing problem
Cited in
(7)- Integrated production and outbound distribution scheduling problems with job release dates and deadlines
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- An integer linear formulation for the file transfer scheduling problem
- 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
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- Jackson's semi-preemptive scheduling on a single machine
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)
