On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
From MaRDI portal
Publication:5187929
DOI10.1002/nav.20352zbMath1182.90040OpenAlexW2012125051MaRDI QIDQ5187929
Ruslan Sadykov, Philippe Baptiste
Publication date: 9 March 2010
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20352
Related Items (8)
Layered graph approaches for combinatorial optimization problems ⋮ Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies ⋮ Minimizing makespan on a single machine with release dates and inventory constraints ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ Perspectives on integer programming for time-dependent models ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Scheduling equal-length jobs on identical parallel machines
- A polyhedral approach to single-machine scheduling problems.
- Solution of the single machine total tardiness problem
- A decomposition algorithm for the single machine total tardiness problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- On decomposition of the total tardiness problem
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- A mixed integer programming model for scheduling orders in a steel mill
- Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- On Scheduling with Ready Times to Minimize Mean Flow Time
- Technical Note—A Note on the Weighted Tardiness Problem
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- The Schedule-Sequencing Problem
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Algorithmic paradoxes of the single-machine total tardiness problem
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
This page was built for publication: On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
