Minimizing the weighted number of tardy jobs on a single machine with release dates
From MaRDI portal
Publication:852934
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
Cites work
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3521521 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A dual algorithm for the one-machine scheduling problem
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Algorithms for Scheduling Independent Tasks
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An O(n) algorithm for the multiple-choice knapsack linear program
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Minimizing late jobs in the general one machine scheduling problem
- Minimizing the weighted number of tardy jobs on a single machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cited in
(30)- Constraint programming approach to a bilevel scheduling problem
- Minimizing the number of tardy job units under release time constraints
- Modeling single machine preemptive scheduling problems for computational efficiency
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- 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
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Server cloud scheduling
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- Unrelated parallel machine scheduling with new criteria: complexity and models
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs
- 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
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- 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
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)
