The one-machine problem with earliness and tardiness penalties

DOI10.1023/A:1026224610295zbMath1154.90490MaRDI QIDQ2464404

Francis Sourd, Safia Kedad-Sidhoum

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling preparation of doses for a chemotherapy service, Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems, A two-stage stochastic programming approach for project planning with uncertain activity durations, Preemption in single machine earliness/tardiness scheduling, A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems, The one-machine just-in-time scheduling problem with preemption, A new model for the preemptive earliness-tardiness scheduling problem, Non-approximability of just-in-time scheduling, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Optimal timing of a sequence of tasks with general completion costs, Earliness-tardiness scheduling with setup considerations, Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models, Lagrangian bounds for just-in-time job-shop scheduling, Single machine scheduling with family setups to minimize total earliness and tardiness, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties, Multicriteria scheduling, Punctuality and idleness in just-in-time scheduling