On complexity of minimizing weighted number of late jobs in unit time open shops

DOI10.1016/S0166-218X(97)81448-5zbMath0872.90047OpenAlexW2017333027MaRDI QIDQ1356519

A. A. Gladky

Publication date: 9 June 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

open shoprelease datesweighted number of late jobsunit time operations\({\mathcal N}{\mathcal P}\)-hard

Mathematics Subject Classification ID

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

Related Items (3)

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. ⋮ On the complexity of minimizing the number of late jobs in unit time open shop

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
• Open shop problems with unit time operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On complexity of minimizing weighted number of late jobs in unit time open shops