Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

Ran Ma, Long Wan, Lijun Wei and Jinjiang Yuan

International Journal of Production Economics, 2014, vol. 156, issue C, 31-38

Abstract: We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the problem, a set of n independent jobs arriving online over time has to be scheduled on m given machines, where the information of each job including its processing time and weight is not known in advance. Each machine can process up to b (bKeywords: Scheduling; Batch processing; Online algorithms; Performance guarantee (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527314001686
Full text for ScienceDirect subscribers only

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:eee:proeco:v:156:y:2014:i:c:p:31-38

DOI: 10.1016/j.ijpe.2014.05.012

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().