Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
From MaRDI portal
Publication:5953167
DOI10.1016/S0305-0548(00)00008-3zbMath1003.90020OpenAlexW1964447957MaRDI QIDQ5953167
Publication date: 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00008-3
Related Items (26)
STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM ⋮ Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date ⋮ Mixed integer formulations using natural variables for single machine scheduling around a common due date ⋮ Minimizing earliness and tardiness penalties in a single-machine problem with a common due date ⋮ Common due date scheduling with autonomous and induced learning ⋮ Temporal linear relaxation in IBM ILOG CP optimizer ⋮ A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date ⋮ Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection ⋮ On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Exponential neighborhood search for a parallel machine scheduling problem ⋮ A differential evolution approach for the common due date early/tardy job scheduling problem ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ Dominance inequalities for scheduling around an unrestrictive common due date ⋮ On scheduling around large restrictive common due windows ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling around a small common due date
- Common due date scheduling problem with separate earliness and tardiness penalties
- Using tabu search to solve the common due date early/tardy machine scheduling problem
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
This page was built for publication: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
