scientific article; zbMATH DE number 1300389

DOI10.1002/(SICI)1520-6750(199808)45:5%3C525::AID-NAV6%3E3.0.CO;2-5zbMATH Open0954.90018MaRDI QIDQ4248926FDOQ4248926

Authors: George J. Kyparisis, C. Koulamas 

Publication date: 9 February 2001

Title of this publication is not available (Why is that?)

Recommendations

• Scheduling shops to minimize the weighted number of late jobs
• 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
• A Note On The Complexity Of Openshop Scheduling Problems

zbMATH Keywords

schedulingopen shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (8)

• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Open shop scheduling problems with late work criteria.
• Customer order scheduling to minimize the number of late jobs
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Open shop scheduling with delays
• Minimizing the number of tardy jobs in two-machine settings with common due date
• Scheduling shops to minimize the weighted number of late jobs

This page was built for publication:

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