Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation

Gang Li, Mei-Ling Luo, Wen-Jie Zhang and Xiao-Yuan Wang

International Journal of Production Research, 2015, vol. 53, issue 4, 1228-1241

Abstract: This article considers a single-machine due-window assignment scheduling problem based on a common flow allowance (i.e. all jobs have slack due window (SLKW)). We assume that the actual processing time of a job is a function of its position in a sequence (learning effect) and its continuously divisible and non-renewable resource allocation. The problem is to determine the optimal due windows, the optimal resource allocation and the processing sequence simultaneously to minimise costs for earliness, tardiness, the window location, window size, makespan and resource consumption. For a linear or a convex function of the amount of a resource allocated to the job, we provide a polynomial time algorithm, respectively. Some extensions of the problem are also shown.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2014.954057 (text/html)
Access to full text is restricted to subscribers.

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:taf:tprsxx:v:53:y:2015:i:4:p:1228-1241

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2014.954057

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().