Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

Shisheng Li and Jinjiang Yuan ()
Additional contact information
Shisheng Li: Zhengzhou University
Jinjiang Yuan: Zhengzhou University

Journal of Combinatorial Optimization, 2010, vol. 19, issue 1, No 7, 84-93

Abstract: Abstract We consider the scheduling of n family jobs with release dates on m identical parallel batching machines. Each batching machine can process up to b jobs simultaneously as a batch. In the bounded model, b

Keywords: Parallel machine; Batching; Approximation algorithm; Worst case ratio; Family (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9163-z 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:19:y:2010:i:1:d:10.1007_s10878-008-9163-z

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

DOI: 10.1007/s10878-008-9163-z

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 ().