Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On-line scheduling with delivery time on a single batch machine
Theoretical Computer Science
Note: A best on-line algorithm for single machine scheduling with small delivery times
Theoretical Computer Science
Best semi-online algorithms for unbounded parallel batch scheduling
Discrete Applied Mathematics
Information Processing Letters
Optimal on-line algorithms for one batch machine with grouped processing times
Journal of Combinatorial Optimization
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
Discrete Applied Mathematics
Optimal algorithms for online single machine scheduling with deteriorating jobs
Theoretical Computer Science
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
Semi-online two-level supply chain scheduling problems
Journal of Scheduling
Batching and delivery in semi-online distribution systems
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider a single-machine on-line scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, i.e., processing requirement and delivery time, become known at its arrival. The objective is to minimize the time by which all jobs have been delivered. We propose and analyze an on-line algorithm based on the following idea: As soon as the machine becomes available for processing, choose an available job with highest priority, and schedule it if its processing requirement is not too large. Otherwise, postpone the start of this job. We prove that our algorithm has performance bound $(\sqrt{5}+1)/2 \approx 1.61803$, and we show that there cannot exist a deterministic on-line algorithm with a better performance ratio for this problem.