A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

被引：0

作者：

Débora P. Ronconi

机构：

[1] Escola Politécnica,Departamento de Engenharia de Produção

[2] Universidade de São Paulo,undefined

来源：

Annals of Operations Research | 2005年 / 138卷

关键词：

flowshop; blocking; makespan; lower bound; branch-and-bound;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

This work addresses the minimization of the makespan criterion for the flowshop problem with blocking. In this environment there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. We propose a lower bound which exploits the occurrence of blocking. A branch-and-bound algorithm that uses this lower bound is described and its efficiency is evaluated on several problems. Results of computational experiments are reported.

引用

页码：53 / 65

页数：12

共 50 条

[1] A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
Ronconi, DP
[J]. ANNALS OF OPERATIONS RESEARCH, 2005, 138 (01) : 53 - 65
[2] Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking
Sanches, Felipe Borreiro
Takano, Mauricio Iwama
Nagano, Marcelo Seido
[J]. ACTA SCIENTIARUM-TECHNOLOGY, 2016, 38 (03) : 321 - 326
[3] A branch-and-bound algorithm for the hybrid flowshop
Moursli, O
Pochet, Y
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 64 (1-3) : 113 - 125
[4] A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
Wang, Cheng
Song, Shiji
Gupta, Jatinder N. D.
Wu, Cheng
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2880 - 2887
[5] A branch-and-bound algorithm for makespan minimization in differentiation flow shops
Liu, Yen-Cheng
Fang, Kuei-Tang
Lin, Bertrand
[J]. ENGINEERING OPTIMIZATION, 2013, 45 (12) : 1397 - 1408
[6] Grid Branch-and-Bound for Permutation Flowshop
Drozdowski, Maciej
Marciniak, Pawel
Pawlak, Grzegorz
Plaza, Maciej
[J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, PT II, 2012, 7204 : 21 - 30
[7] A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time
Bang, June-Young
Jeong, BongJoo
[J]. JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2019, 13 (04)
[8] A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
Cheng, JL
Kise, H
Matsumoto, H
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (03) : 578 - 590
[9] Solving Blocking Flowshop Scheduling Problem with Branch and Bound Algorithm
Toumi, Said
Jarboui, Bassem
Eddaly, Mansour
Rebai, Abdelwaheb
[J]. 2013 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2013, : 411 - 416
[10] A BRANCH AND BOUND ALGORITHM TO MINIMIZE THE NUMBER OF LATE JOBS IN A PERMUTATION FLOWSHOP
HARIRI, AMA
POTTS, CN
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) : 228 - 237

← 1 2 3 4 5 →