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

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 78卷 / 02期

关键词：

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 条

[21] Dynamic heuristics for the generalized job-shop scheduling problem
Ghedjati, Fatima
Portmann, Marie-Claude
[J]. 2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 2562 - +
[22] The Local Search and Experiments of Job-Shop Scheduling Problem
Zhao, Ning
Chen, Si-yu
[J]. PROCEEDINGS OF 2012 3RD INTERNATIONAL ASIA CONFERENCE ON INDUSTRIAL ENGINEERING AND MANAGEMENT INNOVATION (IEMI2012), 2013, : 89 - 95
[23] Identifying and exploiting commonalities for the job-shop scheduling problem
Kammer, Marnix
van den Akker, Marjan
Hoogeveen, Han
[J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) : 1556 - 1561
[24] A Constructive Heuristic for Solving the Job-Shop Scheduling Problem
Mellado, R.
Cubillos, C.
Cabrera, D.
[J]. IEEE LATIN AMERICA TRANSACTIONS, 2016, 14 (06) : 2758 - 2763
[25] INSERTION TECHNIQUES FOR THE HEURISTIC SOLUTION OF THE JOB-SHOP PROBLEM
WERNER, F
WINKLER, A
[J]. DISCRETE APPLIED MATHEMATICS, 1995, 58 (02) : 191 - 211
[26] A new heuristic method for job-shop scheduling problem
Kuang-Ping Liu
[J]. 2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3708 - 3714
[27] Parameter Optimization in GA for Job-Shop Scheduling Problem
Wang, Kefei
Sun, Xueyan
Zhang, Zihui
Qu, Fuzheng
Shi, Yanjun
[J]. 2017 CHINESE AUTOMATION CONGRESS (CAC), 2017, : 3801 - 3806
[28] A genetic algorithm for the Flexible Job-shop Scheduling Problem
Pezzella, F.
Morganti, G.
Ciaschetti, G.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212
[29] Genetic Algorithm for Solving Job-Shop Scheduling Problem
Li XiaoBo
[J]. 2011 AASRI CONFERENCE ON INFORMATION TECHNOLOGY AND ECONOMIC DEVELOPMENT (AASRI-ITED 2011), VOL 1, 2011, : 296 - 298
[30] Modified taboo search algorithm for the Job-Shop problem
Tong, G.
Li, G.Q.
Liu, B.K.
[J]. Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2001, 21 (09):

← 1 2 3 4 5 →