Article ID: | iaor20083045 |
Country: | Netherlands |
Volume: | 14 |
Issue: | 1 |
Start Page Number: | 45 |
End Page Number: | 61 |
Publication Date: | Jul 2007 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Epstein Leah, Ye Deshi |
We study a variant of classical scheduling, which is called scheduling with ‘end of sequence’ information. It is known in advance that the last job has the longest processing time. Moreover, the last job is marked, and thus it is known for every new job whether it is the final job of the sequence. We explore this model on two uniformly related machines, that is, two machines with possibly different speeds. Two objectives are considered, maximizing the minimum completion time and minimizing the maximum completion time (makespan). Let