On-line scheduling with delivery time on a single batch machine

Authors:
Ji Tian;Ruyan Fu;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China
Venue:
Theoretical Computer Science
Year:
2007

Citing 3
Cited 5

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

SIAM Journal on Discrete Mathematics
Scheduling one batch processor subject to job release dates

Discrete Applied Mathematics

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times

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
Semi-online two-level supply chain scheduling problems

Journal of Scheduling
Batching and delivery in semi-online distribution systems

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider a single batch machine on-line scheduling problem with jobs arriving over time. A batch processing machine can handle up to B jobs simultaneously as a batch, and the processing time for a batch is equal to the longest processing time among the jobs in it. Each job becomes available at its arrival time, which is not known in advance, and its characteristics, such as processing time and delivery time, become known at its arrival. Once the processing of a job is completed we deliver it to the destination. The objective is to minimize the time by which all jobs have been delivered. In this paper, we deal with two variants: the unbound model where B is sufficiently large and the bounded model where B is finite. We provide on-line algorithms with competitive ratio 2 for the unbounded model and with competitive ratio 3 for the bounded model. For when each job has the same processing time, we provide on-line algorithms with competitive ratios (5+1)/2, and these results are the best possible.