Parametrized complexity for single machine scheduling with forbidden start and completion times - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Parametrized complexity for single machine scheduling with forbidden start and completion times

Résumé

We consider a problem where tasks are independent and can neither begin nor end at some dates. The objective is to schedule the tasks on a single machine in order to minimize the makespan. This problem is NP-hard and does not belong to APX. We propose a fixed-parameter algorithm for a particular case of this problem. We show that this case is FPT even under High Multiplicity encoding.
Fichier non déposé

Dates et versions

hal-00842000 , version 1 (12-07-2013)

Identifiants

  • HAL Id : hal-00842000 , version 1

Citer

Michaël Gabay, Nadia Brauner, Christophe Rapine. Parametrized complexity for single machine scheduling with forbidden start and completion times. EURO|INFORMS 2013 - 26th European Conference on Operational Research, Rome, Jul 2013, Rome, Italy. ⟨hal-00842000⟩
103 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More