- Conference Article
- 10.1109/icise.2010.5688741
Online batching scheduling with delivery times related to processing times
- Dec 01, 2010
- Jueliang Hu + 2 more +2
We study a single batch machine on-line scheduling problem with delivery times, which is related to processing times. Once the processing of a job is completed it is delivered to the destination, the objective is to minimize the time by which all jobs have been delivered. For each job J <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , its arrival time, processing time and delivery time are denoted by r <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> and q <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , respectively. Two variants are considered: 1) p <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> ≥ βq <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , we provide an optimal on-line algorithm with competitive ratio (√5+1)/2; 2) q <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> = βq <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> , we provide an on-line algorithm with competitive ratio(√β <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> +2β+5−β+1)/2, and give a lower bound (√β+5)/(β+1)+1)/2.
Read more