Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints

Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints

0.00 Avg rating0 Votes
Article ID: iaor2007650
Country: Netherlands
Volume: 171
Issue: 1
Start Page Number: 107
End Page Number: 122
Publication Date: May 2006
Journal: European Journal of Operational Research
Authors:
Abstract:

We consider a scheduling problem with two identical parallel machines and n jobs. For each job we are given its release date when job becomes available for processing. All jobs have equal processing times. Preemptions are allowed. There are precedence constraints between jobs which are given by a (di)graph consisting of a set of outtrees and a number of isolated vertices. The objective is to find a schedule minimizing mean flow time. We suggest an O(n2) algorithm to solve this problem. The suggested algorithm also can be used to solve the related two-machine open shop problem with integer release dates, unit processing times and analogous precedence constraints.

Reviews

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