Scheduling shops to minimize the weighted number of late jobs
From MaRDI portal
Publication:1890952
DOI10.1016/0167-6377(94)90041-8zbMath0823.90061OpenAlexW1967816579MaRDI QIDQ1890952
Bernd Jurisch, Joanna Józefowska, Wiesław X. 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
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Maximizing the weighted number of just-in-time jobs in flow shop scheduling, A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment, A note on the two machine job shop with the weighted late work criterion, Minimizing the number of tardy jobs in two-machine settings with common due date, An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, A survey on offline scheduling with rejection, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, Open shop scheduling problems with late work criteria., Minimizing tardy jobs in a flowshop with common due date, Four decades of research on the open-shop scheduling problem to minimize the makespan, A constraint generation approach for two-machine shop problems with jobs selection, 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, Counting and enumeration complexity with application to multicriteria scheduling, Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, A survey of the state-of-the-art of common due date assignment and scheduling research, Scheduling with generalized and periodic due dates under single- and two-machine environments
Cites Work
