A heuristic job-shop scheduling algorithm to minimize the total holding cost of completed and in-process products subject to no tardy jobs

被引：16
|
作者：
Ohta, H [1 ]
Nakatani, T [1 ]
机构：
[1] Osaka Prefecture Univ, Grad Sch Engn, Dept Ind Engn, Sakai, Osaka 5998531, Japan
来源：
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2006年 / 101卷 / 01期
关键词：
job-shop scheduling; heuristics; due-date constraints; holding cost; shifting bottleneck procedure;
D O I：
10.1016/j.ijpe.2005.05.004
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost problem subject to no tardy jobs. Several benchmark problems which are commonly used for job-shop scheduling problems of minimizing the makespan are solved by the proposed method and the results are reported. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：19 / 29
页数：11
相关论文
共 50 条
  • [41] A Q-Learning-Based Hyper-Heuristic Evolutionary Algorithm for the Distributed Flexible Job-Shop Scheduling Problem
    Wu, Fang-Chun
    Qian, Bin
    Hu, Rong
    Zhang, Zi-Qi
    Wang, Bin
    ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, ICIC 2023, PT I, 2023, 14086 : 251 - 261
  • [42] Mixed Integer Programming Model For Flexible Job-Shop Scheduling Problem (FJS']JSP) To Minimize Makespan And Total Machining Time
    Gran, Shirley Sinatra
    Ismail, Ismariani
    Ajol, Tracy Adeline
    Ibrahim, Abang Feizal Abang
    2015 2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATIONS, AND CONTROL TECHNOLOGY (I4CT), 2015,
  • [43] A hybrid genetic Tabu search algorithm for minimising total completion time in a flexible job-shop scheduling problem
    Fekih, Asma
    Hadda, Hatem
    Kacem, Imed
    Hadj-Alouane, Atidel B.
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2020, 14 (06) : 763 - 781
  • [44] A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time
    Fekih, Asma
    Hadda, Hatem
    Kacem, Imed
    Hadj-Alouane, Atidel B.
    2021 14TH INTERNATIONAL CONFERENCE ON DEVELOPMENTS IN ESYSTEMS ENGINEERING (DESE), 2021, : 443 - 447
  • [45] Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups
    Kim, Ji-Su
    Park, Jung-Hyeon
    Lee, Dong-Ho
    ENGINEERING OPTIMIZATION, 2017, 49 (10) : 1719 - 1732
  • [46] Parallel Machine Selection and Job Scheduling to Minimize Sum of Machine Holding Cost, Total Machine Time Costs, and Total Tardiness Costs
    Alidaee, Bahram
    Li, Haitao
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2014, 11 (01) : 294 - +
  • [47] A Q-learning-based hyper-heuristic evolutionary algorithm for the distributed flexible job-shop scheduling problem with crane transportation
    Zhang, Zi-Qi
    Wu, Fang-Chun
    Qian, Bin
    Hu, Rong
    Wang, Ling
    Jin, Huai-Ping
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 234
  • [48] Minimising the total cost of tardiness and overtime in a resumable capacitated job shop scheduling problem by using an efficient hybrid algorithm
    Rohaninejad M.
    Sahraeian R.
    Nouri B.V.
    Rohaninejad, Mohammad (rohaninejad.sm@gmail.com), 2017, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (26) : 318 - 343
  • [49] A BRANCH-AND-BOUND ALGORITHM FOR TWO-COMPETING-AGENT SINGLE-MACHINE SCHEDULING PROBLEM WITH JOBS UNDER SIMULTANEOUS EFFECTS OF LEARNING AND DETERIORATION TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME WITH NO-TARDY JOBS
    Danaci T.
    Toksari D.
    International Journal of Industrial Engineering : Theory Applications and Practice, 2021, 28 (06): : 577 - 593
  • [50] A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system
    Shabtay, Dvir
    Bensoussan, Yaron
    Kaspi, Moshe
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2012, 136 (01) : 67 - 74
12345