ADJUSTMENT OF HEADS AND TAILS FOR THE JOB-SHOP PROBLEM

被引:129
|
作者
CARLIER, J [1 ]
PINSON, E [1 ]
机构
[1] UNIV CATHOLIQUE OUEST,INST MATH APPL,F-49008 ANGERS 01,FRANCE
关键词
SCHEDULING; JOB-SHOP; BRANCH AND BOUND METHOD;
D O I
10.1016/0377-2217(94)90379-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The efficiency of recent enumerative methods for the job-shop problem crucially depends on immediate selections of disjunctive constraints leading to adjustment of heads and tails. This paper presents new investigations concerning this powerful tool. More efficient algorithms are proposed, and global operations are introduced. We also describe a new lower bound and a new branching scheme which are used to design a branch and bound method. Computational results show that these techniques permit to drastically reduce the size of the search trees.
引用
收藏
页码:146 / 161
页数:16
相关论文
共 50 条
  • [31] Efficient algorithm for the job-shop problem with two jobs
    Brucker, P.
    [J]. 1600, (40):
  • [32] A Hybrid Optimization Algorithm for the Job-shop Scheduling Problem
    Zhou, Qiang
    Cui, Xunxue
    Wang, Zhengshan
    Yang, Bin
    [J]. WORLD SUMMIT ON GENETIC AND EVOLUTIONARY COMPUTATION (GEC 09), 2009, : 757 - 763
  • [33] An evolutionary and genetic view of the job-shop scheduling problem
    Vilela, C
    Brito, L
    Rocha, M
    Gonçalves, P
    Neves, J
    [J]. SIMULATION IN INDUSTRY'99: 11TH EUROPEAN SIMULATION SYMPOSIUM 1999, 1999, : 465 - 469
  • [34] Improved genetic algorithm for the job-shop scheduling problem
    Tung-Kuan Liu
    Jinn-Tsong Tsai
    Jyh-Horng Chou
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 27 : 1021 - 1029
  • [35] A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Jin Feng
    Du, Bi Qiang
    Ding, Hai Min
    [J]. ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, PT I, 2011, 152 : 332 - 339
  • [36] A probabilistic approach to the Stochastic Job-Shop Scheduling problem
    Shoval, Shraga
    Efatmaneshnik, Mahmoud
    [J]. 15TH GLOBAL CONFERENCE ON SUSTAINABLE MANUFACTURING, 2018, 21 : 533 - 540
  • [37] Problem difficulty for tabu search in job-shop scheduling
    Watson, JP
    Beck, JC
    Howe, AE
    Whitley, LD
    [J]. ARTIFICIAL INTELLIGENCE, 2003, 143 (02) : 189 - 217
  • [38] A job-shop problem with one additional resource type
    Agnetis, Alessandro
    Flamini, Marta
    Nicosia, Gaia
    Pacifici, Andrea
    [J]. JOURNAL OF SCHEDULING, 2011, 14 (03) : 225 - 237
  • [39] An efficient makespan prediction for the job-shop problem solving
    Murovec, Boštjan
    [J]. Elektrotehniski Vestnik/Electrotechnical Review, 2002, 69 (3-4): : 234 - 239
  • [40] Job-shop scheduling problem with fuzzy processing times
    Lin, FT
    [J]. COMPUTATIONAL SCIENCE -- ICCS 2001, PROCEEDINGS PT 2, 2001, 2074 : 409 - 418