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 条
[41]   Integration of process planning and job shop scheduling with stochastic processing time [J].
Haddadzade, M. ;
Razfar, M. R. ;
Zarandi, M. H. Fazel .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 71 (1-4) :241-252
[42]   Integration of process planning and job shop scheduling with stochastic processing time [J].
M. Haddadzade ;
M. R. Razfar ;
M. H. Fazel Zarandi .
The International Journal of Advanced Manufacturing Technology, 2014, 71 :241-252
[43]   Current status and developing trend of process planning and Job Shop scheduling [J].
Lyu, Sheng-Ping ;
Qiao, Li-Hong .
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2014, 20 (02) :290-300
[44]   Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness [J].
Mousakhani, M. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) :3476-3487
[45]   Mathematical models for job-shop scheduling problems with routing and process plan flexibility [J].
Ozguven, Cemal ;
Ozbakir, Lale ;
Yavuz, Yasemin .
APPLIED MATHEMATICAL MODELLING, 2010, 34 (06) :1539-1548
[46]   Estimated Tardiness-Based Reinforcement Learning Solution to Repeatable Job-Shop Scheduling Problems [J].
Heo, Chi Yeong ;
Seo, Jun ;
Kim, Yonggang ;
Kim, Yohan ;
Kim, Taewoon .
PROCESSES, 2025, 13 (01)
[47]   Scheduling algorithms for job-shop-type remanufacturing systems with component matching requirement [J].
Yu, Jae-Min ;
Lee, Dong-Ho .
COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 120 :266-278
[48]   A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective [J].
Zhang, Rui ;
Wu, Cheng .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (05) :854-867
[49]   Solving the flexible job-shop just-in-time scheduling problem with quadratic earliness and tardiness costs [J].
Gabriel Zambrano Rey ;
Abdelghani Bekrar ;
Damien Trentesaux ;
Bing-Hai Zhou .
The International Journal of Advanced Manufacturing Technology, 2015, 81 :1871-1891
[50]   Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling problem [J].
Yokoyama, Soichiro ;
Hzuka, Hiroyuki ;
Yamamoto, Masahito .
JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2014, 8 (05)