Note: Open-shop scheduling with release dates to minimize maximum lateness

DOI<141::AID-NAV3220420111>3.0.CO;2-3 10.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3zbMath0820.90055OpenAlexW2072107954MaRDI QIDQ4698134

Gerhard J. Woeginger, Hans Kellerer, Thomas Tautenhahn

Publication date: 14 May 1995

Full work available at URL: https://doi.org/10.1002/1520-6750(199502)42:1<141::aid-nav3220420111>3.0.co;2-3

zbMATH Keywords

polynomial-time algorithmdue datesmaximum latenessarbitrary release datesopen-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

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

Cites Work

• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: Note: Open-shop scheduling with release dates to minimize maximum lateness