Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
From MaRDI portal
Publication:1341403
DOI10.1016/0895-7177(94)90209-7zbMath0810.90070MaRDI QIDQ1341403
Publication date: 11 January 1995
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(94)90209-7
due date; processing time; release date; knapsack-like problem; Moore-Hodgson algorithm; nested inequality constraints; tower of sets
Related Items
Single machine scheduling with deadlines, release and due dates, Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine, A survey of single machine scheduling to minimize weighted number of tardy jobs, A study of single-machine scheduling problem to maximize throughput, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, Reductions between scheduling problems with non-renewable resources and knapsack problems, Minimizing the weighted number of tardy jobs on a single machine with release dates, Genetic algorithms to minimize the weighted number of late jobs on a single machine., Preemptive scheduling of equal-length jobs to maximize weighted throughput., Using short-term memory to minimize the weighted number of late jobs on a single machine., A branch and bound to minimize the number of late jobs on a single machine with release time constraints, Branch less, cut more and minimize the number of late equal-length jobs on identical machines, Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm, Parallel machine problems with equal processing times: a survey, Optimality proof of the Kise-Ibaraki-Mine algorithm, Online scheduling of bounded length jobs to maximize throughput, A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates, Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals
Cites Work
- Unnamed Item
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
