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 条
  • [31] A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem
    Miguel A. Fernández Pérez
    Fernanda M. P. Raupp
    Journal of Intelligent Manufacturing, 2016, 27 : 409 - 416
  • [32] A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem
    Fernandez Perez, Miguel A.
    Raupp, Fernanda M. P.
    JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (02) : 409 - 416
  • [33] A Simulated Annealing-based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness Regular Paper
    Zhang, Rui
    INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2013, 10
  • [34] From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: The holding cost objective
    Bertsimas, D
    Gamarnik, D
    Sethuraman, J
    OPERATIONS RESEARCH, 2003, 51 (05) : 798 - 813
  • [35] A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
    Essafi, Imen
    Mati, Yazid
    Dauzere-Peres, Stephane
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) : 2599 - 2616
  • [36] Discrete Differential Evolutionary Algorithm for Job-Shop Scheduling Problem with Minimizing Total Weighted Tardiness
    Ye, Furong
    You, Zhen
    Zhang, Defu
    Leung, Stephen C. H.
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 56 - 62
  • [37] A Hybrid Differential Evolution Algorithm for Job Shop Scheduling Problem to Minimize the Total Weighted Tardiness
    Wang Wei-ling
    Yin Jing
    2013 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING (ICMSE), 2013, : 294 - 300
  • [38] Hyper-heuristic cross-entropy algorithm for distributed assembly flexible job-shop scheduling problem
    Luo W.-C.
    Qian B.
    Hu R.
    Zhang C.-S.
    Xiang F.-H.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2021, 38 (10): : 1551 - 1568
  • [39] A hybrid estimation of distribution algorithm for flexible job-shop scheduling problems with process plan flexibility
    Ricardo Pérez-Rodríguez
    Arturo Hernández-Aguirre
    Applied Intelligence, 2018, 48 : 3707 - 3734
  • [40] A hybrid estimation of distribution algorithm for flexible job-shop scheduling problems with process plan flexibility
    Perez-Rodriguez, Ricardo
    Hernandez-Aguirre, Arturo
    APPLIED INTELLIGENCE, 2018, 48 (10) : 3707 - 3734
12345