Minimizing the weighted number of tardy jobs on a single machine
From MaRDI portal
Publication:1869424
DOI10.1016/S0377-2217(02)00180-7zbMATH Open1012.90009OpenAlexW2040516673MaRDI QIDQ1869424FDOQ1869424
Authors: Rym M'Hallah, Robert L. Bulfin 
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00180-7
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
- Title not available (Why is that?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for Scheduling Independent Tasks
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- 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
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- 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 survey of algorithms for the single machine total weighted tardiness scheduling problem
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- 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
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs
- 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
- Title not available (Why is that?)
- 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)
