Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
From MaRDI portal
Publication:4432721
DOI10.1002/nav.10056zbMath1030.90030OpenAlexW2009682943MaRDI QIDQ4432721
Marc Sevaux, Stéphane Dauzère-Pérès
Publication date: 29 October 2003
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11250/163839
single machine schedulingmixed-integer linear programmingLagrangian relaxation algorithmmaster sequence
Related Items (16)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Minimizing the weighted number of tardy jobs on a single machine with release dates ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ Scheduling jobs on parallel machines to minimize a regular step total cost function ⋮ Constraint programming approach to a bilevel scheduling problem ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ New MIP model for multiprocessor scheduling problem with communication delays ⋮ Optimal admission control of discrete event systems with real-time constraints ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Minimizing late jobs in the general one machine scheduling problem
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Unnamed Item
- Unnamed Item
This page was built for publication: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
