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

Martin Feldmann, Dirk Biskup

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 PROBLEMVariable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due DateMixed integer formulations using natural variables for single machine scheduling around a common due dateMinimizing earliness and tardiness penalties in a single-machine problem with a common due dateCommon due date scheduling with autonomous and induced learningTemporal linear relaxation in IBM ILOG CP optimizerA sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due dateMinimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenanceMinimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristicsMinmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejectionOn the quadratic model for unrelated parallel machine scheduling problem with restrictive common due dateA heuristic for single machine common due date assignment problem with different earliness/tardiness weightsMinimizing weighted earliness-tardiness on a single machine with a common due date using quadratic modelsMixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and TardinessFormulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due windowExponential neighborhood search for a parallel machine scheduling problemA differential evolution approach for the common due date early/tardy job scheduling problemScheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due dateDominance inequalities for scheduling around an unrestrictive common due dateOn scheduling around large restrictive common due windowsMultiple machine JIT scheduling: a tabu search approachMinimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability intervalOptimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulationsA unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problemsA filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobsA survey of the state-of-the-art of common due date assignment and scheduling research



Cites Work


This page was built for publication: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates