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 条
[21]   Job shop scheduling based on earliness and tardiness penalties with due dates and deadlines: an enhanced genetic algorithm [J].
Hong-an Yang ;
Qi-feng Sun ;
Can Saygin ;
Shu-dong Sun .
The International Journal of Advanced Manufacturing Technology, 2012, 61 :657-666
[22]   Job shop scheduling based on earliness and tardiness penalties with due dates and deadlines: an enhanced genetic algorithm [J].
Yang, Hong-an ;
Sun, Qi-feng ;
Saygin, Can ;
Sun, Shu-dong .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (5-8) :657-666
[23]   Solving the flexible job-shop just-in-time scheduling problem with quadratic earliness and tardiness costs [J].
Rey, Gabriel Zambrano ;
Bekrar, Abdelghani ;
Trentesaux, Damien ;
Zhou, Bing-Hai .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2015, 81 (9-12) :1871-1891
[24]   Quantum algorithms for process parallel flexible job shop scheduling [J].
Denkena, Berend ;
Schinkel, Fritz ;
Pirnay, Jonathan ;
Wilmsmeier, Soren .
CIRP JOURNAL OF MANUFACTURING SCIENCE AND TECHNOLOGY, 2021, 33 :100-114
[25]   A Genetic Algorithm for integration of process planning and scheduling in a job shop [J].
Park, Byung Joo ;
Choi, Hyung Rim .
AI 2006: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4304 :647-+
[26]   A Hybrid Differential Evolution Algorithm for Job Shop Scheduling Problem to Minimize the Total Weighted Tardiness [J].
Wang Wei-ling ;
Yin Jing .
2013 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING (ICMSE), 2013, :294-300
[27]   A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion [J].
Zhang, Rui ;
Song, Shiji ;
Wu, Cheng .
APPLIED SOFT COMPUTING, 2013, 13 (03) :1448-1458
[28]   A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective [J].
Kuhpfahl, J. ;
Bierwirth, C. .
COMPUTERS & OPERATIONS RESEARCH, 2016, 66 :44-57
[29]   The Tool Supporting Decision Making Process in Area of Job-Shop Scheduling [J].
Trojanowska, Justyna ;
Rocha Varela, Maria Leonilde ;
Machado, Jose .
RECENT ADVANCES IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 3, 2017, 571 :490-498
[30]   A Genetic Algorithm for Job Shop Scheduling with Limited Part-changing Times [J].
Wang, Mingjie ;
Feng, Haodi .
PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, :1922-1926