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 条
  • [1] A binary branch and bound algorithm to minimize maximum scheduling cost
    Chandra, Charu
    Liu, Zhixin
    He, Jun
    Ruohonen, Toni
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2014, 42 (01): : 9 - 15
  • [2] BRANCH AND BOUND ALGORITHM FOR MINIMIZING COST IN PROJECT SCHEDULING
    MASON, AT
    MOODIE, CL
    MANAGEMENT SCIENCE SERIES B-APPLICATION, 1971, 18 (04): : B158 - B173
  • [3] Branch-and-bound algorithm for scheduling on single processor with sequence-dependent setup times to minimize maximum tardiness
    Luo, Xiao-Chuan
    Liu, Chang-Yong
    Liu, Xiao
    Wang, Cheng-En
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2005, 26 (10): : 938 - 941
  • [4] A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
    Ozturk, Onur
    Begen, Mehmet A.
    Zaric, Gregory S.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (06) : 1815 - 1831
  • [5] An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
    He, Cheng
    Wu, Jing
    Xu, Jinglei
    Wang, Junling
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (02) : 731 - 741
  • [6] An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
    Pan, YP
    OPERATIONS RESEARCH LETTERS, 2003, 31 (06) : 492 - 496
  • [7] A branch and bound algorithm for the maximum diversity problem
    Marti, Rafael
    Gallego, Micael
    Duarte, Abraham
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (01) : 36 - 44
  • [8] A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
    Tozkapan, A
    Kirca, Ö
    Chung, CS
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (02) : 309 - 320
  • [9] A BRANCH AND BOUND ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
    PARDALOS, PM
    RODGERS, GP
    COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (05) : 363 - 375
  • [10] A branch and bound algorithm for the one-machine scheduling problem,with minimum and maximum time lags
    Sheen, Gwo-Ji
    Liao, Lu-Wen
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) : 102 - 116
12345