On the complexity of minimizing the number of late jobs in unit time open shop
From MaRDI portal
DOI10.1016/S0166-218X(99)00202-4zbMATH Open0971.90030MaRDI QIDQ1962026FDOQ1962026
Authors: Svetlana A. Kravchenko 
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- On complexity of minimizing weighted number of late jobs in unit time open shops
- On minimizing the weighted number of late jobs in unit execution time open-shops.
- Minimizing the weighted number of late jobs in UET open shops
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- Scheduling unit time open shops to minimize the weighted number of late jobs
Cites Work
Cited In (13)
- Scheduling jobs with equal processing times and time windows on identical parallel machines
- Parameterized complexity of machine scheduling: 15 open problems
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- Scheduling Unit-Time Open Shops with Deadlines
- Scheduling unit time open shops to minimize the weighted number of late jobs
- Parallel machine problems with equal processing times: a survey
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- 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
- On complexity of minimizing weighted number of late jobs in unit time open shops
- On minimizing the weighted number of late jobs in unit execution time open-shops.
- On scheduling cycle shops: Classification, complexity and approximation
- Minimizing the weighted number of tardy jobs on multiple machines: a review
This page was built for publication: On the complexity of minimizing the number of late jobs in unit time open shop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962026)
