Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory

DOI10.1287/opre.22.1.46zbMath0294.90034OpenAlexW4234873221MaRDI QIDQ4047360

L. F. Gelders, Paul R. Kleindorfer

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1287/opre.22.1.46

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Preemption in single machine earliness/tardiness scheduling ⋮ Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Scheduling preparation of doses for a chemotherapy service ⋮ Scheduling unrelated parallel machines to minimize total weighted tardiness. ⋮ Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ A dual algorithm for the one-machine scheduling problem ⋮ On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems ⋮ Mathematical Modeling of Scheduling Problems ⋮ A unified formulation of the machine scheduling problem ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ A survey of algorithms for the single machine total weighted tardiness scheduling problem

This page was built for publication: Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory