Scheduling shops to minimize the weighted number of late jobs

DOI10.1016/0167-6377(94)90041-8MaRDI QIDQ1890952zbMATH OpenOpenAlexFDO

Authors Joanna Józefowska, Bernd Jurisch, Wieslaw Kubiak

Publication date 28 May 1995

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(94)90041-8

zbMATH Keywords

NP-hardnessflow shopopen shopjob shopscommon due date

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1300389
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
• On Optimal Common Due-Date Determination
• Scheduling unit time open shops to minimize the weighted number of late jobs

Cites work

• scientific article; zbMATH DE number 3784624 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• `` Strong NP-Completeness Results

Cited in

(25)

• Counting and enumeration complexity with application to multicriteria scheduling
• scientific article; zbMATH DE number 1594554 (Why is no real title available?)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• A survey on offline scheduling with rejection
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• Minimizing tardy jobs in a flowshop with common due date
• Concurrent open shop scheduling to minimize the weighted number of tardy jobs
• Open shop scheduling problems with late work criteria.
• A constraint generation approach for two-machine shop problems with jobs selection
• Sorting common operations to minimize the number of tardy jobs
• A survey of the state-of-the-art of common due date assignment and scheduling research
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
• Scheduling with generalized and periodic due dates under single- and two-machine environments
• A note on the two machine job shop with the weighted late work criterion
• Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
• Scheduling job shops with delays
• Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
• On complexity of minimizing weighted number of late jobs in unit time open shops
• A heuristic for scheduling general job shops to minimize maximum lateness
• Scheduling a two-stage flowshop under makespan constraint
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Minimizing the number of tardy jobs in two-machine settings with common due date

This page was built for publication: Scheduling shops to minimize the weighted number of late jobs

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