Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/43527
Title: Single-machine slack due-window assignment and scheduling with past-sequence-dependent delivery times and controllable job processing times
Authors: Ji, M
Yao, D
Ge, J
Cheng, TCE
Keywords: Learning effect
Past-sequence-dependent delivery times
Resource allocation
Scheduling
SLK due-window assignment
Issue Date: 2015
Publisher: InterScience
Source: European journal of industrial engineering, 2015, v. 9, no. 6, p. 794-818 How to cite?
Journal: European journal of industrial engineering 
Abstract: In this paper, we study single-machine scheduling that considers slack (SLK) due-window assignment, past-sequence-dependent delivery times and controllable job processing times simultaneously. We assume that the actual processing time of a job is a function of the learning effect on the job and resource allocation to the job and the job delivery time is proportional to its waiting time. The objective is to find jointly the optimal job sequence, optimal flow allowance value (i.e., optimal common waiting time) and optimal resource allocation to minimise a total cost comprising the earliness, tardiness, due-window-related and resource consumption costs. We consider two models of the job processing time function and provide polynomial-time solution algorithms for the corresponding problems. We also provide a more efficient solution algorithm for a special case of the problem.
URI: http://hdl.handle.net/10397/43527
ISSN: 1751-5254
DOI: 10.1504/EJIE.2015.074380
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Citations as of Feb 15, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
Citations as of Feb 19, 2017

Page view(s)

8
Last Week
0
Last month
Checked on Feb 12, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.