Abstract
This paper deals with semi-online scheduling on m-batch-machine flow shop. The objective is to minimize the makespan. A parallel batch processing machine can handle up to B jobs simultaneously. We study an unbounded model where B = ∞. The jobs that are processed together construct a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. The problem is online in the sense that jobs arrive over time. Let pi, j(i = 1,…,m) denote the processing time of job Jj on machines Mi, respectively. Let Jj+1 be the following job of Jj in a job instance. We study semi-online problem with jobs' nondecreasing processing times. We focus on the case where p1, j = ⋯ = pm, j for i = 1, …, m and pi, j+1 ≥ βpi, j (β ≥ 1). For this problem, we propose an optimal algorithm [Formula: see text] with a competitive ratio [Formula: see text].
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
