Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines

被引：41
|
作者：
Sun, Lin-Hui [2 ,3 ,6 ,7 ]
Sun, Lin-Yan [3 ,4 ,6 ,7 ]
Wang, Ming-Zheng [5 ]
Wang, Ji-Bo [1 ,3 ,7 ]
机构：
[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Peoples R China
[2] Xian Univ Technol, Sch Econ & Management, Xian 710054, Peoples R China
[3] State Key Lab Mfg Syst Engn, Xian 710053, Peoples R China
[4] Xi An Jiao Tong Univ, Sch Management, Xian 710049, Peoples R China
[5] Dalian Univ Technol, Sch Management Sci & Engn, Dalian 116024, Peoples R China
[6] Minist Educ Proc Control & Efficiency Engn, Key Lab, Xian 710049, Peoples R China
[7] Xi An Jiao Tong Univ, Knowledge Management & Innovat Res Ctr, Xian 710049, Peoples R China
来源：
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2012年 / 138卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Scheduling; Flow shop; Deteriorating jobs; Dominating machines; No-wait; No-idle; DEPENDENT PROCESSING TIMES; WEIGHTED COMPLETION-TIME; LINEAR DETERIORATION; SINGLE-MACHINE; MAXIMUM LATENESS; CONCISE SURVEY; SEQUENCE; SETUPS;
D O I：
10.1016/j.ijpe.2012.03.023
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper studies general, no-wait or no-idle flow shop scheduling problems with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. A linear deterioration function with identical normal processing times of all jobs is assumed and some dominating relationships between machines can be satisfied. For the makespan minimization problems, the following dominant machines constraint: idm, ddm, idm-ddm and ddm-idm are considered. We show that these problems can be solved in polynomial time, although these problems are more complicated than the classical ones. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：195 / 200
页数：6
相关论文
共 50 条
12345