Minimizing Job Idleness in Deadline Constrained Environments

DOI10.1287/OPRE.40.5.972MaRDI QIDQ4015471zbMATH OpenOpenAlexFDO

Authors Uttarayan Bagchi, Reza 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

\(n\)-job, \(m\)-machine flowshop problembranch-and-boundmirror image problemtotal job idleness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Flowshop/no-idle scheduling to minimize total elapsed time
• Flowshop/no-idle scheduling to minimise the mean flowtime
• Preemptive scheduling with deadlines on parallel machines
• The two-machine flowshop scheduling problem with total tardiness
• Minimizing functions of infeasibilities in a two-machine flow shop

Cited in

(5)

• The job shop scheduling problem with convex costs
• Bilevel programming applied to the flow shop scheduling problem
• On the fixed interval due-date scheduling problem
• Punctuality and idleness in just-in-time scheduling
• Flowshop/no-idle scheduling to minimize total elapsed time

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

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