On-line scheduling of small open shops

Bo Chen,Donglei Du,Jiye Han,Jianjun Wen

doi:10.1016/s0166-218x(00)00268-7

On-line scheduling of small open shops

Bo Chen, Donglei Du + Show 2 more

Open Access

https://doi.org/10.1016/s0166-218x(00)00268-7

Copy DOI

Journal: Discrete Applied Mathematics	Publication Date: Apr 24, 2001
Citations: 15	License type: publisher-specific-oa

Affiliation: University of Warwick, The University of Texas at Dallas, University of California, Riverside

#Open Shops #Permutation Algorithm + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We investigate the problem of on-line scheduling open shops of two and three machines with an objective of minimizing the schedule makespan. We first propose a 1.848-competitive permutation algorithm for the non-preemptive scheduling problem of two machines and show that no permutation algorithm can be better than 1.754-competitive. Secondly, we develop a (27/19)-competitive algorithm for the preemptive scheduling problem of three machines, which is most competitive.

Full Text