On minimizing the weighted number of late jobs in unit execution time open-shops.
From MaRDI portal
Publication:1399578
DOI10.1016/S0377-2217(02)00759-2zbMath1127.90349MaRDI QIDQ1399578
Publication date: 30 July 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items (4)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Unnamed Item ⋮ Parameterized complexity of machine scheduling: 15 open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling unit time open shops to minimize the weighted number of late jobs
- On complexity of minimizing weighted number of late jobs in unit time open shops
- Is a unit-job shop not easier than identical parallel machines?
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Scheduling equal-length jobs on identical parallel machines
- On the complexity of minimizing the number of late jobs in unit time open shop
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- A Note On The Complexity Of Openshop Scheduling Problems
- Scheduling identical jobs on uniform parallel machines
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Unit Execution Time Shop Problems
- Open shop problems with unit time operations
- Minimizing the weighted number of late jobs in UET open shops
This page was built for publication: On minimizing the weighted number of late jobs in unit execution time open-shops.
