Minimizing the weighted number of late jobs in UET open shops
From MaRDI portal
Publication:4698122
DOI10.1007/BF01415068zbMath0830.90071MaRDI QIDQ4698122
Gerhard J. Woeginger, Gábor Galambos
Publication date: 25 June 1995
Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01415068
polynomial time algorithm; weighted number of late jobs; two-machine open shop; release dates and due dates
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
On minimizing the weighted number of late jobs in unit execution time open-shops., Minimizing the weighted number of tardy jobs on multiple machines: a review
Cites Work
- Scheduling unit time open shops to minimize the weighted number of late jobs
- A Note On The Complexity Of Openshop Scheduling Problems
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- Unit Execution Time Shop Problems
- Open shop problems with unit time operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey