Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/28418
Title: Group scheduling and job-dependent due window assignment based on a common flow allowance
Authors: Ji, M
Chen, K
Ge, J
Cheng, TCE 
Keywords: Common flow allowance
Earliness/tardiness
Group technology
Job-dependent due window
Single-machine scheduling
Issue Date: 2014
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2014, v. 68, no. 1, p. 35-41 How to cite?
Journal: Computers and industrial engineering 
Abstract: We study a single-machine group scheduling and job-dependent due window assignment problem in which each job is assigned an individual due window based on a common flow allowance. In the group technology environment, the jobs are divided into groups in advance according to their processing similarities and all the jobs of the same group are processed consecutively in order to improve production efficiency. A sequence-independent machine setup time precedes the processing of the first job of each group. A job completed earlier (later) than its due window will incur an earliness (tardiness) penalty. Our goal is to find the optimal sequence for both the groups and jobs, together with the optimal due window assignment, to minimize the total cost that comprises the earliness and tardiness penalties, and the due window starting time and due window size costs. We give an O(n log n)time algorithm to solve this problem.
URI: http://hdl.handle.net/10397/28418
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2013.11.017
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

16
Last Week
0
Last month
0
Citations as of Sep 9, 2017

WEB OF SCIENCETM
Citations

14
Last Week
2
Last month
0
Citations as of Sep 16, 2017

Page view(s)

65
Last Week
2
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



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