文献类型：期刊文献

英文题名：Online algorithms for batch machines scheduling with delivery times

作者：Liu, Peihai[1]; Lu, Xiwen[1]

机构：[1] Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China

年份：2013

卷号：7936 LNCS

起止页码：114

外文期刊名：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

收录：EI(收录号：20134116830150)

语种：英文

外文关键词：Combinatorial optimization - Scheduling

摘要：We consider online scheduling on m batch machines with delivery times. In this paper online means that jobs arrive over time and the characteristics of jobs are unknown until their arrival times. Once the processing of a job is completed it is delivered to the destination. The objective is to minimize the time by which all jobs have been delivered. For each job J j, its processing time and delivery time are denoted by p j and q j, respectively. We first consider a restricted model: the jobs have agreeable processing and delivery times, i.e., for any two jobs J i and J j, p i > p j implies q i ≥ q j . For the restrict case, we provide a best possible online algorithm with competitive ratio 1 + α m, where α m > 0 is determined by. Then we present an online algorithm with a competitive ratio of for the general case. ? 2013 Springer-Verlag Berlin Heidelberg.