Parallel machine problems with equal processing times: a survey

Parallel machine problems with equal processing times: a survey

0.00 Avg rating—0 Votes
Article ID: iaor20119062
Volume: 14
Issue: 5
Start Page Number: 435
End Page Number: 444
Publication Date: Oct 2011
Journal: Journal of Scheduling
Authors: ,
Keywords: literature survey, parallel machines
Abstract:

The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. In this paper, we survey existing approaches for the problem class considered.

Reviews

Required fields are marked *. Your email address will not be published.