Scheduling Unit-Time Open Shops with Deadlines

DOI10.1287/OPRE.42.1.189MaRDI QIDQ4287611zbMATH OpenOpenAlexFDO

Authors Thomas Tautenhahn

Publication date 12 December 1994

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

deadlinedue datesmaximum latenessnumber of tardy jobsopen shoppolynomial algorithmtotal tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• scientific article; zbMATH DE number 894721
• Scheduling unit time open shops to minimize the weighted number of late jobs
• scientific article; zbMATH DE number 2109433
• On the complexity of minimizing the number of late jobs in unit time open shop

Cited in

(11)

• Scheduling unit time open shops to minimize the weighted number of late jobs
• Minimizing the total completion time in a unit-time open shop with release times
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Open shop scheduling with makespan and total completion time criteria
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Time buffers in the open shop problem
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Open shop scheduling with delays
• Nonpreemptive open shop with restricted processing times
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops
• scientific article; zbMATH DE number 894721 (Why is no real title available?)

This page was built for publication: Scheduling Unit-Time Open Shops with Deadlines

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