Minimizing the weighted number of late jobs in UET open shops

DOI10.1007/BF01415068zbMath0830.90071OpenAlexW2059944968MaRDI QIDQ4698122

Gerhard J. Woeginger, Gábor Galambos

Publication date: 25 June 1995

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 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

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

Related Items (2)

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.

Cites Work

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

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