Scheduling with flexible resources in parallel workcenters to minimize maximum completion time

Scheduling with flexible resources in parallel workcenters to minimize maximum completion time

0.00 Avg rating0 Votes
Article ID: iaor20073266
Country: United Kingdom
Volume: 34
Issue: 1
Start Page Number: 48
End Page Number: 69
Publication Date: Jan 2007
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

In this paper we consider the parallel machine scheduling problem with dual resource constraints with the objective of minimizing the maximum completion time. We develop heuristics that combine list-scheduling and bin-packing approaches with rules to iteratively modify the flexible resource allocation. A lower bound is presented and the previous and proposed solution approaches to the problem are analyzed under a variety of experimental conditions, demonstrating that there are advantages to the proposed heuristics.

Reviews

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