Minimizing the weighted number of tardy jobs on parallel processors

We present a branch-and-bound algorithm to minimize the weighted number of tardy jobs on either identical or non-identical processors. Bounds come from a surrogate relaxation resulting in a multiple-choice knapsack. Extensive computational experiments indicate problems with 400 jobs and several mach...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2005-01, Vol.160 (2), p.471-484
Hauptverfasser:	M'Hallah, Rym, Bulfin, R.L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Branch & bound algorithms Branch and bound Combinatorial optimization Job shops Operations research Optimization Parallel processing Production scheduling Scheduling Studies Surrogate relaxation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!