The one-machine problem with earliness and tardiness penalties

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

Safia Kedad-Sidhoum, Francis Sourd

Publication date: 20 December 2007

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ An exact extended formulation for the unrelated parallel machine total weighted completion time problem ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Scheduling preparation of doses for a chemotherapy service ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ EA/G-GA for single machine scheduling problems with earliness/tardiness costs ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ 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 ⋮ Optimal timing of a sequence of tasks with general completion costs ⋮ Earliness-tardiness scheduling with setup considerations ⋮ 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 ⋮ Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers ⋮ Non-approximability of just-in-time scheduling ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates ⋮ Multicriteria scheduling ⋮ Punctuality and idleness in just-in-time scheduling