Single Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Single Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness

Résumé

This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem P m|di = d| P wiTi. A new dynamic programming algorithm is proposed to solve the 1|di = d| P wiTi scheduling problem and a fully polynomial time approximation scheme (FPTAS) is deduced from this algorithm. We show that the complexity of this FPTAS is better than existing one. These results are generalized to the parallel machines scheduling case.
Fichier non déposé

Dates et versions

hal-01025549 , version 1 (18-07-2014)

Identifiants

  • HAL Id : hal-01025549 , version 1

Citer

Huynh Tuong Nguyen, Ameur Soukhal, Jean-Charles Billaut. Single Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness. 3rd Multidisciplinary International Conference on Scheduling: Theory and Application, Aug 2007, Paris, France. pp.498-505. ⟨hal-01025549⟩
32 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More