期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 68, 期 -, 页码 35-41出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2013.11.017
关键词
Single-machine scheduling; Group technology; Common flow allowance; Job-dependent due window; Earliness/tardiness
资金
- Humanities and Social Sciences Planning Foundation of the Ministry of Education [13YJA630034]
- National Basic Research Program of China (973 Program) [2012CB315804]
- key innovation team of Science Technology Department of Zhejiang Province [2010R50041]
- Contemporary Business and Trade Research Center of Zhejiang Gongshang University is the key Research Institute of Social Sciences and Humanities of the Ministry of Education
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 logn)time algorithm to solve this problem. (C) 2013 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据