On the complexity of minimizing the number of late jobs in unit time open shop
From MaRDI portal
Publication:1962026
DOI10.1016/S0166-218X(99)00202-4zbMath0971.90030MaRDI QIDQ1962026
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling jobs with equal processing times and time windows on identical parallel machines, The complexity of mean flow time scheduling problems with release times, On minimizing the weighted number of late jobs in unit execution time open-shops., Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, On scheduling cycle shops: Classification, complexity and approximation, Parameterized complexity of machine scheduling: 15 open problems, Branch less, cut more and minimize the number of late equal-length jobs on identical machines, Minimizing the weighted number of tardy jobs on multiple machines: a review, Parallel machine problems with equal processing times: a survey
Cites Work