Article ID: | iaor20032316 |
Country: | Portugal |
Volume: | 22 |
Issue: | 2 |
Start Page Number: | 235 |
End Page Number: | 251 |
Publication Date: | Dec 2002 |
Journal: | Investigao Operacional |
Authors: | Alves Rui, Valente Jorge |
Keywords: | programming: dynamic |
In this paper we consider a version of the total earliness/tardiness problem in which the jobs' due dates, as well as the holding and tardiness costs, may differ. It is also assumed that no unforced idle time may be inserted in a sequence. After a brief literature review, we present some heuristics and a dynamic programming procedure and analyse their performance for problems with both identical and non identical release dates.