On the complexity of minimizing the number of late jobs in unit time open shop

DOI10.1016/S0166-218X(99)00202-4MaRDI QIDQ1962026zbMATH OpenFDO

Authors Svetlana A. Kravchenko

Publication date 30 January 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00202-4

zbMATH Keywords

complexityunary NP-hardunit time open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• On complexity of minimizing weighted number of late jobs in unit time open shops
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

Cited in

(16)

• 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?
• 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 number of late jobs for the two-machine unit-time job-shop scheduling problem
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Parallel machine problems with equal processing times: a survey
• Scheduling Unit-Time Open Shops with Deadlines
• Minimizing the weighted number of late jobs in UET open shops
• Minimizing the sojourn time of open shop scheduling problems with unit-time operations
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• The complexity of mean flow time scheduling problems with release times

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)