Improved analysis of an algorithm for the coupled task problem with UET (unit execution time) jobs

Improved analysis of an algorithm for the coupled task problem with UET (unit execution time) jobs

0.00 Avg rating—0 Votes
Article ID: iaor20102933
Volume: 37
Issue: 2
Start Page Number: 93
End Page Number: 96
Publication Date: Mar 2009
Journal: Operations Research Letters
Authors: , , ,
Abstract:

The coupled task problem is to schedule n jobs, each one consisting of two subtasks with exact delay times between them, on a single machine. We derive a new lower bound for the problem variant with unit execution times and correct a previously published analysis.

Reviews

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