Minimizing late jobs in the general one machine scheduling problem

DOI10.1016/0377-2217(94)00116-TzbMath0913.90166OpenAlexW2086491340MaRDI 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 boundheuristicrelease datesone machinedifferent due datesminimizing the number of late jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (19)

Graph colouring approaches for a satellite range scheduling problem ⋮ A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation ⋮ 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 ⋮ Minimizing late jobs in the general one machine scheduling problem ⋮ Algorithms for Necklace Maps ⋮ 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 ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ Genetic algorithms to minimize the weighted number of late jobs on a single machine. ⋮ 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 ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine ⋮ An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs ⋮ 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

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

This page was built for publication: Minimizing late jobs in the general one machine scheduling problem