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

DOI10.1287/OPRE.22.1.46zbMATH Open0294.90034OpenAlexW4234873221MaRDI QIDQ4047360FDOQ4047360

Authors 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

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

Cited in

(12)

• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A dual algorithm for the one-machine scheduling problem
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Four solution techniques for a general one machine scheduling problem. A comparative study
• 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 unified formulation of the machine scheduling problem
• Preemption in single machine earliness/tardiness scheduling
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• Scheduling preparation of doses for a chemotherapy service
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• Mathematical Modeling of Scheduling Problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047360)