Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions

In this paper, we consider a parallel machine problem where machines and jobs can be classified into two levels: high and low levels. A high-level machine can process all jobs while a low-level machine can process only low-level jobs. The objective of the problem is to minimize the makespan. This pr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The open operational research journal 2008-03, Vol.2 (1), p.18-24
Hauptverfasser:	Lin, Chien-Hung, Liao, Ching-Jong
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computation Constrictions Heuristic methods Low level Mathematical models Operational research Optimization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!