Minimizing late jobs in the general one machine scheduling problem

DOI10.1016/0377-2217(94)00116-TzbMath0913.90166MaRDI QIDQ1130035

Stéphane Dauzère-Pérès

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00116-t

zbMATH Keywords

lower bound; heuristic; release dates; one machine; different due dates; minimizing the number of late jobs

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine, Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, An improved decision support model for scheduling production in an engineer-to-order manufacturer, 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, A survey of single machine scheduling to minimize weighted number of tardy jobs, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, Graph colouring approaches for a satellite range scheduling problem, Minimizing the weighted number of tardy jobs on a single machine with release dates, Minimizing late jobs in the general one machine scheduling problem, An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Genetic algorithms to minimize the weighted number of late jobs on a single machine., A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Minimizing the weighted number of tardy jobs on a single machine, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation, Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Algorithms for Necklace Maps

Cites Work

• Unnamed Item
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Minimizing late jobs in the general one machine scheduling problem
• On the complexity of generalized due date scheduling problems
• 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