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

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.

Download Full-text

Minimizing Hiring Cost of the Machine Under No Idle Constraints in N*2 Flow Shop Scheduling with Transportation and Set Up Time.

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.b7565.129219 ◽

2019 ◽

Vol 9 (2) ◽

pp. 5227-5229

Keyword(s):

Flow Shop ◽

Setup Time ◽

Idle Time ◽

Flow Shop Scheduling ◽

Start Time ◽

Transportation Time ◽

Shop Scheduling ◽

Set Up

The present paper deals with a problem of n*2 flow shop scheduling where setup time of the machines are separated from their dispensation time and transportation time for moving from first machine to second machine is also given. Our aim is to get the most favorable jobs sequence which can make machines idle time equal to zero so that rental cost can be minimized. In order to ensure no idle constraint, we have developed an algorithm in which we have delayed the start time of machine B, so that machine B works continuously without any idle time. A simple mathematical example is also given to clear the concept.

Download Full-text

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

Discrete Dynamics in Nature and Society ◽

10.1155/2020/3530701 ◽

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.

Download Full-text