NEW BOUND FOR MACHINE SCHEDULING

被引：19

作者：

BESTWICK, PF ^{[1
]}

HASTINGS, NAJ ^{[1
]}

机构：

[1] UNIV BRADFORD,CTR MANAGEMENT,BRADFORD,ENGLAND

来源：

OPERATIONAL RESEARCH QUARTERLY | 1976年 / 27卷 / 02期

关键词：

D O I：

10.2307/3008817

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：479 / 487

页数：9

共 50 条

[1] NEW BOUND FOR MACHINE SCHEDULING.
Bestwick, Paul F.
Hastings, N.A.J.
1600, (27):
[2] A NEW LOWER BOUND APPROACH FOR SINGLE-MACHINE MULTICRITERIA SCHEDULING
HOOGEVEEN, JA
VANDEVELDE, SL
OPERATIONS RESEARCH LETTERS, 1992, 11 (01) : 39 - 44
[3] A NEW LOWER-BOUND FOR THE MAKESPAN OF A SINGLE-MACHINE SCHEDULING PROBLEM
TINHOFER, G
FARNBACHER, E
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1992, 180 : 209 - 218
[4] NEW TRENDS IN MACHINE SCHEDULING
BLAZEWICZ, J
FINKE, G
HAUPT, R
SCHMIDT, G
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 37 (03) : 303 - 317
[5] Revisiting branch and bound search strategies for machine scheduling problems
T'kindt, V
Della Croce, F
Esswein, C
JOURNAL OF SCHEDULING, 2004, 7 (06) : 429 - 440
[6] ON BOUND OF MAKESPANS AND ITS APPLICATION IN M MACHINE SCHEDULING PROBLEM
NABESHIMA, I
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1967, 9 (3-4) : 98 - +
[7] Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems
V. T'kindt
F. Della Croce
C. Esswein
Journal of Scheduling, 2004, 7 : 429 - 440
[8] A New Lower Bound for Deterministic Truthful Scheduling
Giannakopoulos, Yiannis
Hammerl, Alexander
Pocas, Diogo
ALGORITHMICA, 2021, 83 (09) : 2895 - 2913
[9] Parametric LPT-bound on parallel machine scheduling with nonsimultaneous machine available time
He, Y
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1998, 15 (01) : 29 - 36
[10] A New Lower Bound for Deterministic Truthful Scheduling
Yiannis Giannakopoulos
Alexander Hammerl
Diogo Poças
Algorithmica, 2021, 83 : 2895 - 2913

← 1 2 3 4 5 →