Assessing the impact of changing available multiple process plans of a job type on mean tardiness in job shop scheduling

被引:5
作者
Phanden, Rakesh Kumar [1 ]
Jain, Ajai [2 ]
机构
[1] MM Univ, Dept Mech Engn, Mullana, Ambala, India
[2] Natl Inst Technol, Dept Mech Engn, Kurukshetra, Haryana, India
关键词
Multiple process plan; Job shop scheduling; Mean tardiness; Simulation; Genetic algorithm; WEIGHTED TARDINESS; GENETIC ALGORITHMS; FLOWSHOPS; SYSTEM;
D O I
10.1007/s00170-015-7123-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper assesses the impact of changing the available multiple process plans of a job type in a production order on mean tardiness using simulation based genetic algorithm approach. A restart scheme as suggested in the literature is embedded into genetic algorithm in order to prevent premature convergence. An algorithm is developed to select a job type that becomes a candidate in order to change the available multiple process plans. Three case studies of varying sizes have been considered to assess the performance of job shop with an objective to minimise mean tardiness. Results indicate that by changing the available multiple process plans of a job type in a production order assists in reducing mean tardiness of a production order. In addition, selecting the best process plan among available multiple process plans on the basis of minimum total production time criterion for a job type does not yield optimal schedule.
引用
收藏
页码:1521 / 1545
页数:25
相关论文
共 50 条
[31]   Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem [J].
Tan, Yi ;
Hildebrandt, Torsten ;
Scholz-Reiter, Bernd .
JOURNAL OF SCHEDULING, 2016, 19 (04) :429-452
[32]   Finding multiple solutions in job shop scheduling by niching genetic algorithms [J].
Pérez, E ;
Herrera, F ;
Hernández, C .
JOURNAL OF INTELLIGENT MANUFACTURING, 2003, 14 (3-4) :323-339
[33]   Combined Timetabling Procedure and Complete Local Search for No-Wait Job Shop Scheduling with Total Tardiness [J].
杨玉珍 ;
顾幸生 .
JournalofDonghuaUniversity(EnglishEdition), 2014, 31 (02) :83-91
[34]   Finding multiple solutions in job shop scheduling by niching genetic algorithms [J].
E. Pérez ;
F. Herrera ;
C. Hernández .
Journal of Intelligent Manufacturing, 2003, 14 :323-339
[35]   Pareto archived simulated annealing for job shop scheduling with multiple objectives [J].
R.K. Suresh ;
K.M. Mohanasundaram .
The International Journal of Advanced Manufacturing Technology, 2006, 29 :184-196
[36]   Pareto archived simulated annealing for job shop scheduling with multiple objectives [J].
Suresh, R. K. ;
Mohanasundaram, K. M. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 29 (1-2) :184-196
[37]   Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives [J].
Gao, K. Z. ;
Suganthan, P. N. ;
Pan, Q. K. ;
Chua, T. J. ;
Cai, T. X. ;
Chong, C. S. .
JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (02) :363-374
[38]   AN IMPROVED GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEM WITH PROCESS SEQUENCE FLEXIBILITY [J].
Huang, X. W. ;
Zhao, X. Y. ;
Ma, X. L. .
INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2014, 13 (04) :510-522
[39]   A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem [J].
Essafi, Imen ;
Mati, Yazid ;
Dauzere-Peres, Stephane .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) :2599-2616
[40]   A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling [J].
Kim, YK ;
Park, K ;
Ko, J .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) :1151-1171