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

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 divisi...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 53; no. 4; pp. 1228 - 1241
Main Authors Li, Gang, Luo, Mei-Ling, Zhang, Wen-Jie, Wang, Xiao-Yuan
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 16.02.2015
Taylor & Francis LLC
Subjects
Algorithms
Allowances
Assignment problem
common flow allowance
Convex analysis
due-window
Functions (mathematics)
Job shops
Learning
learning effect
Mathematical analysis
Optimization
Production scheduling
Resource allocation
Resource scheduling
Scheduling
Studies
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2014.954057