A dual-criteria flow shop scheduling with sequence-dependent setup times

被引:1
作者
Nailwal, Kewal Krishan [1 ]
Gupta, Deepak [2 ]
Sharma, Sameer [3 ]
机构
[1] APJ Coll Fine Arts, Dept Math, Jalandhar City, Punjab, India
[2] MM Univ Mullana, Dept Math, Ambala, Haryana, India
[3] DAV Coll, Dept Math, Jalandhar City, Punjab, India
关键词
Scheduling; Total elapsed time; Sequence-dependent setup time; Breakdown interval; Operational cost; Operation time;
D O I
10.1080/02522667.2015.1026460
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.
引用
收藏
页码:485 / 500
页数:16
相关论文
共 29 条
[1]   A review of scheduling research involving setup considerations [J].
Allahverdi, A ;
Gupta, JND ;
Aldowaisan, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1999, 27 (02) :219-239
[2]   A survey of scheduling problems with setup times or costs [J].
Allahverdi, Ali ;
Ng, C. T. ;
Cheng, T. C. E. ;
Kovalyov, Mikhail Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :985-1032
[3]  
Bagga PC, 2000, INDIAN J PURE AP MAT, V31, P1475
[4]  
Baker K., 1974, INTRO SEQUENCING SCH
[5]  
Campbell H. G., 1970, MANAGE SCI, V16, P630
[6]  
Cheng TCE, 2000, PROD OPER MANAG, V9, P262, DOI 10.1111/j.1937-5956.2000.tb00137.x
[7]   Two-machine flowshop scheduling with bicriteria problem [J].
Chou, FD ;
Lee, CE .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 36 (03) :549-564
[8]   2 MACHINE FLOW SHOP SCHEDULING PROBLEMS WITH SEQUENCE DEPENDENT SETUP TIMES - DYNAMIC-PROGRAMMING APPROACH [J].
CORWIN, BD ;
ESOGBUE, AO .
NAVAL RESEARCH LOGISTICS, 1974, 21 (03) :515-524
[9]   A bicriteria m-machine flowshop scheduling with sequence-dependent setup times [J].
Eren, Tamer .
APPLIED MATHEMATICAL MODELLING, 2010, 34 (02) :284-293
[10]   Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times [J].
Gagné, C ;
Price, WL ;
Gravel, M .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (08) :895-906