An Adaptative Multi-GPU Based Branch-and-Bound. A Case Study: The Flow-Shop Scheduling Problem

A Nash bargaining model for flow shop scheduling problem under uncertainty: a case study from tire manufacturing in Iran

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-017-1461-0 ◽

2018 ◽

Vol 96 (1-4) ◽

pp. 531-546

Author(s):

Ghasem Safari ◽

Ashkan Hafezalkotob ◽

Mohammad Khalilzadeh

Keyword(s):

Flow Shop ◽

Nash Bargaining ◽

Flow Shop Scheduling ◽

Bargaining Model ◽

Scheduling Problem ◽

Optimization of Flow Shop Scheduling Problem using Tabu Search Algorithm: A Case Study

IOP Conference Series Materials Science and Engineering ◽

10.1088/1757-899x/506/1/012064 ◽

2019 ◽

Vol 506 ◽

pp. 012064

Author(s):

SS Dewi ◽

Andriansyah ◽

Syahriza

Keyword(s):

Tabu Search ◽

Flow Shop ◽

Search Algorithm ◽

Flow Shop Scheduling ◽

Tabu Search Algorithm ◽

Scheduling Problem ◽

A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

Engineering Optimization ◽

10.1080/0305215x.2019.1632303 ◽

2019 ◽

Vol 52 (6) ◽

pp. 1009-1036 ◽

Cited By ~ 3

Author(s):

Chin-Chia Wu ◽

Danyu Bai ◽

Ameni Azzouz ◽

I.-Hong Chung ◽

Shuenn-Ren Cheng ◽

...

Keyword(s):

Branch And Bound ◽

Completion Time ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Total Completion Time ◽

Scheduling Problem ◽

Two Stage ◽

Flow Shop Scheduling Problem and Solution in Cooperative Robotics—Case-Study: One Cobot in Cooperation with One Worker

Future Internet ◽

10.3390/fi9030048 ◽

2017 ◽

Vol 9 (3) ◽

pp. 48 ◽

Cited By ~ 7

Author(s):

Ahmed Sadik ◽

Bodo Urban

Keyword(s):

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Cooperative Robotics ◽

A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem

European Journal of Operational Research ◽

10.1016/j.ejor.2020.01.039 ◽

2020 ◽

Vol 284 (3) ◽

pp. 814-833 ◽

Cited By ~ 5

Author(s):

Jan Gmys ◽

Mohand Mezmaz ◽

Nouredine Melab ◽

Daniel Tuyttens

Keyword(s):

Branch And Bound ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Computationally Efficient ◽

Shop Scheduling ◽

Permutation Flow Shop Scheduling ◽

Permutation Flow Shop

Improved makespan of the branch and bound solution for a fuzzy flow-shop scheduling problem using the maximization operator

Malaya Journal of Matematik ◽

10.26637/mjm0701/0018 ◽

2019 ◽

Vol 7 (1) ◽

pp. 91-95

Author(s):

V. Vinoba ◽

N. Selvamalar

Keyword(s):

Branch And Bound ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Shop Scheduling ◽

Bound Solution

A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem

2016 IEEE International Conference on Automation Science and Engineering (CASE) ◽

10.1109/coase.2016.7743493 ◽

2016 ◽

Author(s):

Marcus Ritt

Keyword(s):

Branch And Bound ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Shop Scheduling ◽

Permutation Flow Shop Scheduling ◽

Permutation Flow Shop ◽

Best First Search

A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations

Applied Mathematical Modelling ◽

10.1016/j.apm.2013.06.005 ◽

2014 ◽

Vol 38 (1) ◽

pp. 119-134 ◽

Cited By ~ 38

Author(s):

Parviz Fattahi ◽

Seyed Mohammad Hassan Hosseini ◽

Fariborz Jolai ◽

Reza Tavakkoli-Moghaddam

Keyword(s):

Branch And Bound ◽

Flow Shop ◽

Setup Time ◽

Flow Shop Scheduling ◽

Hybrid Flow Shop ◽

Scheduling Problem ◽

Shop Scheduling ◽

Hybrid Flow Shop Scheduling ◽

Assembly Operations

Branch and Bound Method to Overcome Delay Delivery Order in Flow Shop Scheduling Problem

IOP Conference Series Materials Science and Engineering ◽

10.1088/1757-899x/1003/1/012129 ◽

2020 ◽

Vol 1003 ◽

pp. 012129

Author(s):

Chadziqatun Najilatil Mazda ◽

Dwi Agustina Kurniawati

Keyword(s):

Branch And Bound ◽

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Branch And Bound Method ◽

A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry

Expert Systems with Applications ◽

10.1016/j.eswa.2015.03.012 ◽

2015 ◽

Vol 42 (15-16) ◽

pp. 6196-6204 ◽

Cited By ~ 18

Author(s):

Sungbum Jun ◽

Jinwoo Park

Keyword(s):

Genetic Algorithm ◽

Flow Shop ◽

Hybrid Genetic Algorithm ◽

Flow Shop Scheduling ◽

Hybrid Flow Shop ◽

Scheduling Problem ◽

Shop Scheduling ◽

Hybrid Flow Shop Scheduling