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.013zbMATH Open1103.90045OpenAlexW1989488450MaRDI QIDQ852934FDOQ852934
Authors: 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
Recommendations
- Minimizing the weighted number of tardy jobs on a single machine
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for Scheduling Independent Tasks
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Minimizing the weighted number of tardy jobs on a single machine
- Title not available (Why is that?)
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- An O(n) algorithm for the multiple-choice knapsack linear program
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- A dual algorithm for the one-machine scheduling problem
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Algorithms for Scheduling a Single Machine to Minimize the Weighted 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
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Title not available (Why is that?)
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Title not available (Why is that?)
Cited In (30)
- Unrelated parallel machine scheduling with new criteria: complexity and models
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- Server cloud scheduling
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- An exact method to minimize the number of tardy jobs in single machine scheduling
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Exact approaches for single machine total weighted tardiness batch scheduling
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- Minimizing the weighted number of tardy jobs on a single machine
- Modeling single machine preemptive scheduling problems for computational efficiency
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Minimizing the number of tardy job units under release time constraints
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs
- Constraint programming approach to a bilevel scheduling problem
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- 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: strongly correlated instances
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
This page was built for publication: Minimizing the weighted number of tardy jobs on a single machine with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852934)
