Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

DOI10.1016/S0305-0548(00)00008-3zbMath1003.90020MaRDI QIDQ5953167

Dirk Biskup, Martin Feldmann

Publication date: 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

scheduling; common due date; benchmark

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM, Multiple machine JIT scheduling: a tabu search approach, Temporal linear relaxation in IBM ILOG CP optimizer, 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, On scheduling around large restrictive common due windows, A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date, 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, Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, A survey of the state-of-the-art of common due date assignment and scheduling research, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, Common due date scheduling with autonomous and induced learning, On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date, Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models, Exponential neighborhood search for a parallel machine scheduling problem, Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date, Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness

Cites Work

• Unnamed Item
• 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
• 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