Minimizing the weighted number of late jobs in UET open shops

DOI10.1007/BF01415068MaRDI QIDQ4698122zbMATH OpenOpenAlexFDO

Authors Gábor Galambos, Gerhard J. Woeginger

Publication date 25 June 1995

Published in 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

zbMATH Keywords

polynomial time algorithmweighted number of late jobstwo-machine open shoprelease dates and due dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On minimizing the weighted number of late jobs in unit execution time open-shops.
• 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
• scientific article; zbMATH DE number 930117
• On the complexity of minimizing the number of late jobs in unit time open shop

Cites work

• A Note On The Complexity Of Openshop Scheduling Problems
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Scheduling unit time open shops to minimize the weighted number of late jobs
• Unit Execution Time Shop Problems

Cited in

(5)

• On the complexity of minimizing the number of late jobs in unit time open shop
• 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
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• On minimizing the weighted number of late jobs in unit execution time open-shops.

This page was built for publication: Minimizing the weighted number of late jobs in UET open shops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698122)