Minimizing Job Idleness in Deadline Constrained Environments

DOI10.1287/opre.40.5.972zbMath0758.90043OpenAlexW2130941882MaRDI QIDQ4015471

Uttarayan Bagchi, Reza H. Ahmadi

Publication date: 5 January 1993

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

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

zbMATH Keywords

branch-and-bound\(n\)-job, \(m\)-machine flowshop problemmirror image problemtotal job idleness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Bilevel programming applied to the flow shop scheduling problem ⋮ On the fixed interval due-date scheduling problem ⋮ The job shop scheduling problem with convex costs

This page was built for publication: Minimizing Job Idleness in Deadline Constrained Environments