Minimizing the earliness--tardiness costs on a single machine

DOI10.1016/j.cor.2005.02.037zbMath1113.90057OpenAlexW2158962496MaRDI QIDQ2499156

Joanna Józefowska, Jakub Bauman

Publication date: 14 August 2006

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

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.037

zbMATH Keywords

schedulingsingle machinejust-in-timeearliness--tardiness costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

An exact algorithm for the bi-objective timing problem ⋮ A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ An improved earliness--tardiness timing algorithm ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence ⋮ Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates

Cites Work

• Unnamed Item
• PERT scheduling with convex cost functions.
• Sequencing with Earliness and Tardiness Penalties: A Review
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties