Single-machine scheduling with flow time and earliness penalties

Single-machine scheduling with flow time and earliness penalties

0.00 Avg rating—0 Votes
Article ID: iaor2000818
Country: United States
Volume: 3
Issue: 3
Start Page Number: 289
End Page Number: 309
Publication Date: Jul 1993
Journal: Journal of Global Optimization
Authors: , ,
Keywords: programming: dynamic
Abstract:

This paper considers the problem of scheduling n jobs on a single machine to minimize the total cost incurred by their respective flow time and earliness penalties. It is assumed that each job has a due date that must be met, and that preemptions are not allowed. The problem is formulated as a dynamic program and solved with a reaching algorithm that exploits a series.

Reviews

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