Scheduling chains on a single machine with non-negative time lags

Scheduling chains on a single machine with non-negative time lags

0.00 Avg rating0 Votes
Article ID: iaor20041015
Country: Germany
Volume: 57
Issue: 1
Start Page Number: 111
End Page Number: 123
Publication Date: Jan 2003
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the operations have the same duration p and all the delays are equal to a constant l. Next, we consider that the length of any delay is less than the shortest processing time and we present an algorithm to minimize the makespan and another one to minimize the flow time when all the processing times are equal.

Reviews

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