A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
From MaRDI portal
Publication:1040984
DOI10.1016/j.ejor.2009.06.033zbMath1176.90249MaRDI QIDQ1040984
Jean-Charles Billaut, Ameur Soukhal, Nguyen Huynh Tuong
Publication date: 27 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.033
Related Items
Two-agent scheduling on uniform parallel machines with min-max criteria, Soft due window assignment and scheduling of unit-time jobs on parallel machines, A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems, Scheduling two agents on uniform parallel machines with~makespan and cost functions, A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem
Cites Work
- Unnamed Item
- Unnamed Item
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine scheduling to minimize total weighted tardiness
- A fully polynomial approximation scheme for the total tardiness problem
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Minimizing Total Tardiness on One Machine is NP-Hard
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
