Minimizing the total completion time in a unit-time open shop with release times

DOI10.1016/S0167-6377(97)00015-1zbMath0885.90062OpenAlexW2076906849WikidataQ127633500 ScholiaQ127633500MaRDI QIDQ1362528

Thomas Tautenhahn, Gerhard J. Woeginger

Publication date: 5 August 1997

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00015-1

zbMATH Keywords

dynamic programmingrelease timestotal completion timeunit-time open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

The complexity of mean flow time scheduling problems with release times, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Unit-time scheduling problems with time dependent resources, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Scheduling unit time open shops to minimize the weighted number of late jobs
• A preemptive open shop scheduling problem with one resource
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• On Edge Coloring Bipartite Graphs
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Unit-Time Open Shops with Deadlines
• Note: Open-shop scheduling with release dates to minimize maximum lateness
• Unnamed Item
• Unnamed Item