Flow-Shop Scheduling with the Branch-and-Bound Method

1967 ◽  
Vol 15 (3) ◽  
pp. 473-481 ◽  
Author(s):  
G. B. McMahon ◽  
P. G. Burton
Keyword(s):  
Branch And Bound ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Branch And Bound Method ◽  
Shop Scheduling

Flow shop scheduling for separation model of set-up and net process based on Branch-and-Bound method

2009 ◽  
Vol 57 (2) ◽  
pp. 550-562
Author(s):  
Kenzo Kurihara ◽  
Yann-Liang Li ◽  
Nobuyuki Nishiuchi ◽  
Kazuaki Masuda
Keyword(s):  
Branch And Bound ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Branch And Bound Method ◽  
Shop Scheduling ◽  
Set Up ◽  
Separation Model

Branch and Bound Method with Heuristic Algorithm for a Special Flexible Flow Shop Scheduling Problem

2010 ◽  
Vol 139-141 ◽  
pp. 1530-1534 ◽  
Author(s):  
Zhan Tao Li ◽  
Fu Hong ◽  
Qing Xin Chen ◽  
Ning Mao
Keyword(s):  
Branch And Bound ◽  
Heuristic Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Branch And Bound Method ◽  
Optimal Method ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Flexible Flow Shop Scheduling

This paper deals with an optimal method for solving a 2-stage flexible flow shop scheduling problem with group constraint, batch released dates. This problem is known to be NP-hard. In this paper, first of all, we construct a mathematical model for the problem. Then, we develop a branch and bound method with heuristic algorithm for the optimal solution of the problem. During the initialization, we use a heuristic algorithm H’ as the initial solution. We propose two branching algorithms in the branching procedure and two algorithms for the lower bound. We also propose a set of instances for this type of problem. The results are shown that our branch and bound method is effective for small and medium-sized problem but large-sized problem.

scholarly journals A Robust Two-Machine Flow-Shop Scheduling Model with Scenario-Dependent Processing Times

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Chia-Lun Hsu ◽  
Win-Chin Lin ◽  
Lini Duan ◽  
Jan-Ray Liao ◽  
Chin-Chia Wu ◽  
...  
Keyword(s):  
Branch And Bound ◽  
Flow Shop ◽  
Real Life ◽  
Flow Shop Scheduling ◽  
Branch And Bound Method ◽  
Processing Times ◽  
Working Environments ◽  
Optimality Properties ◽  
Cloud Theory ◽  
Simple Heuristics

In many scheduling studies, researchers consider the processing times of jobs as constant numbers. This assumption sometimes is at odds with practical manufacturing process due to several sources of uncertainties arising from real-life situations. Examples are the changing working environments, machine breakdowns, tool quality variations and unavailability, and so on. In light of the phenomenon of scenario-dependent processing times existing in many applications, this paper proposes to incorporate scenario-dependent processing times into a two-machine flow-shop environment with the objective of minimizing the total completion time. The problem under consideration is never explored. To solve it, we first derive a lower bound and two optimality properties to enhance the searching efficiency of a branch-and-bound method. Then, we propose 12 simple heuristics and their corresponding counterparts improved by a pairwise interchange method. Furthermore, we set proposed 12 simple heuristics as the 12 initial seeds to design 12 variants of a cloud theory-based simulated annealing (CSA) algorithm. Finally, we conduct simulations and report the performances of the proposed branch-and-bound method, the 12 heuristics, and the 12 variants of CSA algorithm.

scholarly journals Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan

2019 ◽  
Vol 2 (1) ◽  
pp. 20
Author(s):  
Dana Marsetiya Utama
Keyword(s):  
Numerical Experiment ◽  
Branch And Bound ◽  
Processing Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Branch And Bound Algorithms ◽  
Flexible Flowshop

This article discussed the problem of flow shop scheduling to minimize the makespan. The purpose of this article is to develop the LPT and Branch And Bound (LPT-Branch And Bound) algorithms to minimize the makespan. The proposed method is Longest Processing Time (LPT) and Branch And Bound. Stage settlement is divided into 3 parts. To proved the proposed algorithm, a numerical experiment was conducted by comparing the LPT-LN algorithm. The result of the numerical experiment shows that LPT-Branch And Bound's proposed algorithm is more efficient than the LPT-LN algorithm.

Sign in / Sign up

Export Citation Format

Share Document