Minimizing the weighted number of tardy jobs on a single machine
From MaRDI portal
(Redirected from Publication:1869424)
Recommendations
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- 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
- Minimizing the weighted number of tardy jobs on parallel processors
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
Cites work
- scientific article; zbMATH DE number 193499 (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 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
- Minimizing late jobs in the general one machine scheduling problem
Cited in
(27)- A note on combined job selection and sequencing problems
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- MP or not MP: that is the question
- Minimizing the weighted number of tardy jobs via \((\max,+)\)-convolutions
- scientific article; zbMATH DE number 123937 (Why is no real title available?)
- Minimizing the weighted number of tardy jobs on parallel processors
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Minimizing the weighted number of tardy task units
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- 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
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- 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
- Minimizing the weighted sum of squared tardiness on a single machine
- scientific article; zbMATH DE number 4217092 (Why is no real title available?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869424)
