An improved earliness–tardiness timing algorithm

An improved earliness–tardiness timing algorithm

0.00 Avg rating0 Votes
Article ID: iaor20083032
Country: United Kingdom
Volume: 34
Issue: 10
Start Page Number: 2931
End Page Number: 2938
Publication Date: Oct 2007
Journal: Computers and Operations Research
Authors: ,
Abstract:

Earliness–tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem.

Reviews

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