Jackson's rule for single-machine scheduling: making a good heuristic better
Mathematics of Operations Research
SIAM Journal on Discrete Mathematics
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
Computers and Operations Research
Supply chain scheduling: Batching and delivery
Operations Research
Integrated Scheduling of Production and Distribution Operations
Management Science
Single machine scheduling with release dates and job delivery to minimize the makespan
Theoretical Computer Science
On-line two-machine job shop scheduling with time lags
Information Processing Letters
Unbounded parallel batch scheduling with job delivery to minimize makespan
Operations Research Letters
Integrated production and distribution scheduling with committed delivery dates
Operations Research Letters
| Hi-index | 0.00 |
In this paper, we consider the on-line integrated production and outbound distribution scheduling problem to minimize the maximum delivery completion time. All jobs arrive over time, and each job and its processing time become known at its arrival time. The jobs are first processed on a single machine and then delivered by a vehicle to a single customer. The vehicle can deliver at most c jobs to the customer at a time. When preemption is allowed and c驴2, we can provide an on-line algorithm with the best competitive ratio $\frac{\sqrt{5}+1}{2}\approx1.618$ . When preemption is not allowed, we provide an on-line algorithm which has the best competitive ratio $\frac{\sqrt{5}+1}{2}\approx1.618$ for the case c=1 and has an asymptotic competitive ratio $\frac{\sqrt{5}+1}{2}\approx1.618$ for the case c驴2.