Online unbounded batch scheduling on parallel machines with delivery times

Peihai Liu () and Xiwen Lu
Additional contact information
Peihai Liu: East China University of Science and Technology
Xiwen Lu: East China University of Science and Technology

Journal of Combinatorial Optimization, 2015, vol. 29, issue 1, No 14, 228-236

Abstract: Abstract We consider the online unbounded batch scheduling problems on $$m$$ m identical machines subject to release dates and delivery times. Jobs arrive over time and the characteristics of jobs are unknown until their arrival times. Jobs can be processed in a common batch and the batch capacity is unbounded. Once the processing of a job is completed it is independently delivered to the destination. The objective is to minimize the time by which all jobs have been delivered. For each job $$J_j$$ J j , its processing time and delivery time are denoted by $$p_j$$ p j and $$q_j$$ 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$$ J i and $$J_j\,p_i>p_j$$ J j p i > p j implies $$q_i\ge q_j$$ q i ≥ q j . For the restrict case, we provide a best possible online algorithm with competitive ratio $$1+\alpha _m$$ 1 + α m , where $$\alpha _m>0$$ α m > 0 is determined by $$\alpha _m^2+m\alpha _m=1$$ α m 2 + m α m = 1 . Then we present an online algorithm with a competitive ratio of $$1+2/\lfloor \sqrt{m}\rfloor $$ 1 + 2 / ⌊ m ⌋ for the general case.

Keywords: Scheduling; Online algorithm; Batch machines; Delivery times; Competitive ratio (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9706-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-014-9706-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9706-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().