Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines

Abstract : Batch processing machine scheduling in uncertain environment attracts more and more attention in the last decade. This paper deals with semi-online scheduling on two parallel batch processing machines with non-decreasing processing time of job. Jobs arrive over time in the online paradigm, and the processing time of any batch is equal to the length of the last arrival job in the batch. We study the unbounded model where each processing batch may contain an unlimited number of jobs, and the objective is to minimize the makespan. Given any job (Formula presented.) together with its following job (Formula presented.), it is assumed that their processing times satisfy (Formula presented.) where α ≥ 1 is a constant. That is, jobs arrive in a non-decreasing order of processing times. We mainly propose an optimal ϕ-competitive online algorithm where ϕ ≥ 1 is a solution of equation ϕ3 + (α-1)ϕ2 + (α2 - α - 1)ϕ - α2 = 0.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01096246
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, December 17, 2014 - 9:55:32 AM
Last modification on : Wednesday, January 22, 2020 - 11:39:31 AM

Links full text

Identifiers

Citation

Ming Liu, Feifeng Zheng, Zhanguo Zhu, Chengbin Chu. Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines. Asia-Pacific Journal of Operational Research, World Scientific Publishing, 2014, 31 (5), (elec. proc.). ⟨10.1142/S0217595914500389⟩. ⟨hal-01096246⟩

Share

Metrics

Record views

321