Approximation Bounds for a General class of precedence constrained parallel machine problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

Approximation Bounds for a General class of precedence constrained parallel machine problems

Résumé

A well studied and difficult class of scheduling problems con- cerns parallel machines and precedence constraints. In order to model more realistic situations, we consider precedence delays, associating with each precedence constraint a certain amount of time which must elapse between the completion and start times of the corresponding jobs. Re- lease dates, among others, may be modeled in this fashion. We provide the first constant-factor approximation algorithms for the makespan and the total weighted completion time objectives in this general class of problems. These algorithms are rather simple and practical forms of list scheduling. Our analysis also unifies and simplifies that of a number of special cases heretofore separately studied, while actually improving some of the former approximation results.

Dates et versions

hal-01617939 , version 1 (17-10-2017)

Identifiants

Citer

Alix Munier, Maurice Queyranne, Andreas S. Schulz. Approximation Bounds for a General class of precedence constrained parallel machine problems. IPCO'98 - 6th International Conference on Integer Programming and Combinatorial Optimization, Jun 1998, Houston, Texas, United States. pp.367-382, ⟨10.1007/3-540-69346-7_28⟩. ⟨hal-01617939⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More