Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan

Shisheng Li, C.T. Ng, T.C.E. Cheng and Jinjiang Yuan

European Journal of Operational Research, 2011, vol. 210, issue 3, 482-488

Abstract: We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine. Each job's processing time is an increasing simple linear function of its starting time. The machine can process up to b jobs simultaneously as a batch. The objective is to minimize the maximum completion time, i.e., makespan. For the unbounded model, i.e., b = [infinity], we obtain an O(n log n) dynamic programming algorithm. For the bounded model, i.e., b

Keywords: Scheduling; Batching; Deterioration; Release; dates; Dynamic; programming (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00799-X
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:ejores:v:210:y:2011:i:3:p:482-488

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().