A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

被引：38
|
作者：
Sourd, Francis [1 ]
Kedad-Sidhoum, Safia [2 ]
机构：
[1] LIP6, CNRS, F-75252 Paris 05, France
[2] Univ Paris 06, LIP6, F-75252 Paris, France
来源：
JOURNAL OF SCHEDULING | 2008年 / 11卷 / 01期
关键词：
one-machine scheduling; earliness-tardiness; Lagrangean relaxation; branch-and-bound;
D O I：
10.1007/s10951-007-0048-2
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.
引用
收藏
页码：49 / 58
页数：10
相关论文
共 50 条
  • [1] A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
    Francis Sourd
    Safia Kedad-Sidhoum
    [J]. Journal of Scheduling, 2008, 11 : 49 - 58
  • [2] A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
    Liaw, CF
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (07) : 679 - 693
  • [3] A branch-and-bound algorithm for the single-machine weighted earliness-tardiness scheduling problem with job independent weights
    Tanaka, S
    Sasaki, T
    Araki, M
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 1571 - 1577
  • [4] The single machine earliness and tardiness scheduling problem: Lower bounds and a branch-and-bound algorithm
    Ronconi, Débora P.
    Kawamura, Márcio S.
    [J]. Computational and Applied Mathematics, 2010, 29 (02) : 107 - 124
  • [5] A Branch and Bound Algorithm for the Weighted Earliness-Tardiness Project Scheduling Problem with Generalized Precedence Relations
    Nadjafi, B. Afshar
    Shadrokh, S.
    [J]. SCIENTIA IRANICA TRANSACTION E-INDUSTRIAL ENGINEERING, 2009, 16 (01): : 55 - 64
  • [6] The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
    Ronconi, Debora P.
    Kawamura, Marcio S.
    [J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2010, 29 (02): : 107 - 124
  • [7] A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
    Kianfar, K.
    Moslehi, G.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 2978 - 2990
  • [8] A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
    Keshavarz, Taha
    Savelsbergh, Martin
    Salmasi, Nasser
    [J]. APPLIED MATHEMATICAL MODELLING, 2015, 39 (20) : 6410 - 6424
  • [9] Chemical Reaction Optimization for Earliness-Tardiness Scheduling problem
    Cheng, Chen
    Tan, Yuejin
    He, Renjie
    Yao, Feng
    [J]. APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 2594 - 2598
  • [10] A new model for the preemptive earliness-tardiness scheduling problem
    Runge, Nina
    Sourd, Francis
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) : 2242 - 2249
12345