Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

DOI10.1287/moor.23.4.930zbMath0977.90017OpenAlexW2059028956MaRDI QIDQ2757573

Sushil Verma, Maged M. Dessouky

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7d8b24dd7954545c195cf5558ec851240d4e86d3

zbMATH Keywords

earliness and tardiness penaltiessingle-machine schedulingunit-time jobslimear programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine ⋮ Preemption in single machine earliness/tardiness scheduling ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ Non-approximability of just-in-time scheduling ⋮ Multicriteria scheduling ⋮ Punctuality and idleness in just-in-time scheduling