Minimizing the weighted number of tardy jobs on a single machine with release dates
From MaRDI portal
Publication:852934
DOI10.1016/J.EJOR.2005.08.013zbMath1103.90045OpenAlexW1989488450MaRDI QIDQ852934
Robert L. Bulfin, Rym M'Hallah
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.08.013
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (14)
Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation ⋮ A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ Constraint programming approach to a bilevel scheduling problem ⋮ Scheduling linear deteriorating jobs to minimize the number of tardy jobs ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ Server cloud scheduling ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Minimizing late jobs in the general one machine scheduling problem
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Minimizing the weighted number of tardy jobs on a single machine
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- An exact method to minimize the number of tardy jobs in single machine scheduling
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- An O(n) algorithm for the multiple-choice knapsack linear program
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Algorithms for Scheduling Independent Tasks
- A dual algorithm for the one-machine scheduling problem
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- 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
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: Minimizing the weighted number of tardy jobs on a single machine with release dates
