Scheduling unit time open shops to minimize the weighted number of late jobs

DOI10.1016/0167-6377(93)90088-XzbMath0793.90028OpenAlexW1978964060MaRDI QIDQ1318657

Bernd Jurisch, Peter Brucker, Frank Werner, Thomas Tautenhahn

Publication date: 6 April 1994

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

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90088-x

zbMATH Keywords

open shoppolynomial algorithmunit processing timesweighted number of late jobsfixed number of machines

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Minimizing the weighted number of tardy jobs on multiple machines: a review, On complexity of minimizing weighted number of late jobs in unit time open shops, Minimizing the total completion time in a unit-time open shop with release times, On minimizing the weighted number of late jobs in unit execution time open-shops., Parameterized complexity of machine scheduling: 15 open problems, Minimizing the weighted number of late jobs in UET open shops

Cites Work

• A Note On The Complexity Of Openshop Scheduling Problems
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Open shop problems with unit time operations
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey