A binary branch and bound algorithm to minimize maximum scheduling cost

被引：0

作者：

Chandra, Charu ^{[1
]}

Liu, Zhixin ^{[1
]}

He, Jun ^{[1
]}

Ruohonen, Toni ^{[2
]}

机构：

[1] Department of Management Studies, College of Business, University of Michigan-Dearborn, 19000 Hubbard Drive, Dearborn, MI 48126, United States

[2] Department of Mathematical Information Technology, University of Jyväskylä, Finland

来源：

Omega (United Kingdom) | 2014年 / 42卷 / 01期

关键词：

32;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：9 / 15

共 50 条

[31] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
Khoudi, Asmaa
Berrichi, Ali
OPERATIONAL RESEARCH, 2020, 20 (03) : 1763 - 1789
[32] SCHEDULING TO MINIMIZE MAXIMUM WORKLOAD
LUTHI, HJ
POLYMERIS, A
MANAGEMENT SCIENCE, 1985, 31 (11) : 1409 - 1415
[33] Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem
McCreesh, Ciaran
Prosser, Patrick
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014, 2014, 8656 : 549 - 563
[34] A parallel branch and bound algorithm for the maximum labelled clique problem
McCreesh, Ciaran
Prosser, Patrick
OPTIMIZATION LETTERS, 2015, 9 (05) : 949 - 960
[35] BRANCH AND BOUND ALGORITHM FOR MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING
DECANI, JS
BIOMETRIKA, 1972, 59 (01) : 131 - 135
[36] A heuristic algorithm to minimize energy cost for scheduling test facilities
Sundaram, RM
Blair, L
COMPUTERS & INDUSTRIAL ENGINEERING, 1996, 31 (1-2) : 359 - 362
[37] Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
Crauwels, HAJ
Potts, CN
Van Oudheusden, D
Van Wassenhove, LN
JOURNAL OF SCHEDULING, 2005, 8 (02) : 161 - 177
[38] An efficient branch-and-bound algorithm for finding a maximum clique
Tomita, E
Seki, T
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2731 : 278 - 289
[39] A parallel branch and bound algorithm for the maximum labelled clique problem
Ciaran McCreesh
Patrick Prosser
Optimization Letters, 2015, 9 : 949 - 960
[40] Branch-and-bound algorithm for the maximum triangle packing problem
Abdelsadek, Youcef
Herrmann, Francine
Kacem, Imed
Otjacques, Benoit
COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 81 : 147 - 157

← 1 2 3 4 5 →