Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

被引：27
|
作者：
Sourd, F [1 ]
机构：
[1] Univ Paris 06, CNRS, LIP6, F-75252 Paris 05, France
来源：
OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 05期
关键词：
earliness-tardiness scheduling; very large neighborhood search;
D O I：
10.1016/j.orl.2005.06.005
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also present experimental results. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：591 / 598
页数：8
相关论文
共 50 条
  • [1] Earliness-tardiness scheduling with setup considerations
    Sourd, F
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (07) : 1849 - 1865
  • [2] Single machine earliness-tardiness scheduling with resource-dependent release dates
    Ventura, JA
    Kim, D
    Garriga, F
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 142 (01) : 52 - 69
  • [3] Scheduling with batch setup times and earliness-tardiness penalties
    Chen, ZL
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 518 - 537
  • [4] Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
    Detienne, Boris
    Pinson, Eric
    Rivreau, David
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (01) : 45 - 54
  • [5] A hybrid algorithm for earliness-tardiness scheduling problem with sequence dependent setup time
    Wang, L
    Wang, M
    [J]. PROCEEDINGS OF THE 36TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 1997, : 1219 - 1222
  • [6] Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
    Kedad-Sidhoum, Safia
    Solis, Yasmin Rios
    Sourd, Francis
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1305 - 1316
  • [7] 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
  • [8] A new model for the preemptive earliness-tardiness scheduling problem
    Runge, Nina
    Sourd, Francis
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (07) : 2242 - 2249
  • [9] Scheduling a Fuzzy Flowshop Problem to Minimize Weighted Earliness-tardiness
    Yan, Ping
    Jiao, Ming-hai
    Zhao, Li-qiang
    [J]. 2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2013, : 2736 - 2740
  • [10] High multiplicity in earliness-tardiness scheduling
    Clifford, JJ
    Posner, ME
    [J]. OPERATIONS RESEARCH, 2000, 48 (05) : 788 - 800
12345