Automated job shop scheduling with dynamic processing times and due dates using project management and industry 4.0

被引:20
|
作者
Kianpour, Parsa [1 ]
Gupta, Deepak [2 ]
Krishnan, Krishna Kumar [2 ]
Gopalakrishnan, Bhaskaran [3 ]
机构
[1] Cummins Inc, Analyt & Artificial Intelligence Dept, Columbus, IN 47202 USA
[2] Wichita State Univ, Coll Engn, Wichita, KS USA
[3] West Virginia Univ, Dept Ind & Management Syst Engn, Morgantown, WV 26506 USA
关键词
Job shop scheduling; tardiness; earliness; industry; 4.0; earned value analysis; SINGLE-MACHINE; PARALLEL MACHINES; FRAMEWORK; PERFORMANCE; STRATEGIES; ALGORITHM; ORDERS;
D O I
10.1080/21681015.2021.1937725
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents an automated model for improving job shop scheduling by incorporating Industry 4.0 and project management. The proposed model develops dynamic and adaptive schedules to incorporate real-time information about processing times (including random unexpected events) and due dates, reflecting the impact of industry 4.0 on rescheduling decisions. The model minimizes the earliness and tardiness costs while considering the rescheduling costs and is motivated by the real-life case study from a local company. This study applied Earned Value (EV) and Forecasted Total Cost at Completion (EAC(f)) concepts and integrated it with mixed integer linear programming (MILP) model to design an adaptive automated scheduling system. The paper presents a new application of project management concept in MILP job shop scheduling. Also, this research proposes new rescheduling concept to minimize unnecessary schedule changes while providing the best possible schedule to process all the jobs.
引用
收藏
页码:485 / 498
页数:14
相关论文
共 50 条
  • [1] JOB SHOP SCHEDULING WITH DUE DATES AND VARIABLE PROCESSING TIMES
    HOLLOWAY, CA
    NELSON, RT
    MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (09): : 1264 - 1275
  • [2] Solving Job-Shop Scheduling Problems with Fuzzy Processing Times and Fuzzy Due Dates
    Alejandro Bustos-Tellez, Camilo
    Sebastian Tenjo-Garcia, Jhoan
    Carlos Figueroa-Garcia, Juan
    INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: THEORY AND FOUNDATIONS, IPMU 2018, PT I, 2018, 853 : 790 - 799
  • [3] JOB SHOP SCHEDULING TO MEET DUE DATES WITH CONSIDERATION TO SEQUENCE DEPENDENT SETUP TIMES IN A DYNAMIC ENVIRONMENT
    Eguchi, Toru
    Nishi, Katsutoshi
    Kawai, Hiroaki
    Murayama, Takeshi
    PROCEEDINGS OF THE ASME/ISCIE INTERNATIONAL SYMPOSIUM ON FLEXIBLE AUTOMATION, ISFA 2012, 2013, : 365 - 368
  • [4] SIMULATION STUDY OF JOB SHOP SCHEDULING WITH DUE DATES
    CHENG, TCE
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1988, 19 (03) : 383 - 390
  • [5] JOB SHOP SCHEDULING WITH DUE DATES AND OVERTIME CAPABILITY
    HOLLOWAY, CA
    NELSON, RT
    MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 21 (01): : 68 - 78
  • [6] Job shop scheduling with unit, processing times
    Bansal, Nikhil
    Kimbrel, Tracy
    Sviridenko, Maxim
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 207 - 214
  • [7] Job shop scheduling with unit processing times
    Bansal, Nikhil
    Kimbrel, Tracy
    Sviridenko, Maxim
    MATHEMATICS OF OPERATIONS RESEARCH, 2006, 31 (02) : 381 - 389
  • [8] Flow shop scheduling with two distinct job due dates
    Koulamas, Christos
    Kyparisis, George J.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 163
  • [9] Determination of due dates in job shop scheduling by simulated annealing
    Mamalis, AG
    Malagardis, I
    COMPUTER INTEGRATED MANUFACTURING SYSTEMS, 1996, 9 (02): : 65 - 72
  • [10] Flow shop scheduling with two distinct job due dates
    Koulamas, Christos
    Kyparisis, George J.
    Computers and Industrial Engineering, 2022, 163