An Efficient Flow Shop Scheduling Problem With Makespan Objective

Scheduling ‘n’ job in ‘m’ machine is a tedious task for the Research scholar to solve this type of problem. Flow shop scheduling has its origin in the manufacturing industries in the early 1954. In this paper, we have developed an algorithm with the objective is to minimize the total elapsed time (makespan). Examples are illustrated to demonstrate the proposed approach in detail. Finally, the result obtained under the proposed method is compared with the existing methods available in the literature. It is found that our algorithm performs better than the existing algorithm and the result have been incorporated in this article.

Download Full-text

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.605-607.528 ◽

2012 ◽

Vol 605-607 ◽

pp. 528-531

Author(s):

Dan Tang ◽

Hong Ping Shu

Keyword(s):

Heuristic Algorithm ◽

Processing Time ◽

Flow Shop ◽

Heuristic Method ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Average Quality ◽

Simulation Experiments ◽

Shop Scheduling ◽

Better Than

For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition, and mining characteristics of the problem itself further. By which analysis, the new heuristic method proposed in the paper shorten the waiting time of each job as much as possible on the basis of reduce the processing time of the first machine and last job. The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

Download Full-text

Minimization of Utilization Time for Specially Structured n × 3 Scheduling Model with Jobs in a String of Disjoint Job Blocks

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

10.35940/ijitee.l2629.1081219 ◽

2019 ◽

Vol 8 (12) ◽

pp. 3554-3558

Keyword(s):

Flow Shop ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Numerical Illustration ◽

Optimal Sequence ◽

Shop Scheduling ◽

Elapsed Time ◽

Processing Times ◽

Scheduling Model ◽

Utilization Time

The present paper investigates n×3 specially structured flow shop scheduling model with processing of jobs on given machines in a string of disjoint job blocks and with probabilities associated to the processing times of jobs. The objective is to minimize utilization time of second and third machine and also minimize the total elapsed time for processing the jobs for n×3 specially structured flow shop scheduling problem. The algorithm developed in this paper is quite straightforward and easy to understand and also present an essential way out to the decision maker for attaining an optimal sequence of jobs. The algorithm developed in this paper is validated by a numerical illustration.

Download Full-text

An Effective Immune Based Approach for the No-Wait Flow Shop Scheduling Problems with Multiple Machines

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.97-101.2432 ◽

2010 ◽

Vol 97-101 ◽

pp. 2432-2435 ◽

Cited By ~ 1

Author(s):

Yi Chih Hsieh ◽

Y.C. Lee ◽

Peng Sheng You ◽

Ta Cheng Chen

Keyword(s):

Flow Shop ◽

Immune Algorithm ◽

Flow Shop Scheduling ◽

Benchmark Problems ◽

Scheduling Problem ◽

Scheduling Problems ◽

Practical Applications ◽

Shop Scheduling ◽

No Wait ◽

Better Than

For scheduling problems, no-wait constraint is an important requirement for many industries. As known, the no-wait scheduling problem is NP-hard and has several practical applications. This paper applies an immune algorithm to solve the multiple-machine no-wait flow shop scheduling problem with minimizing the makespan. Twenty-three benchmark problems on the OR-Library are solved by the immune algorithm. Limited numerical results show that the immune algorithm performs better than the other typical approaches in the literature for most of instances.

Download Full-text

An Efficient Hybrid Based on HS and GA Solving Blocking Flow Shop Scheduling Problems

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.479-481.1893 ◽

2012 ◽

Vol 479-481 ◽

pp. 1893-1896

Author(s):

Yun Bao ◽

Liping Zheng ◽

Hua Jiang

Keyword(s):

Genetic Algorithm ◽

Computational Result ◽

Flow Shop ◽

Harmony Search ◽

Hybrid Algorithms ◽

Flow Shop Scheduling ◽

Scheduling Problem ◽

Scheduling Problems ◽

Shop Scheduling ◽

Better Than

This paper presents an efficient hybrid algorithms (EHA) based on harmony search (HS) algorithms and genetic algorithm (GA) for solving blocking flow shop scheduling problem. An improved GA is used to get better results. The computational result shows that EHA is not only better than GA , but also better than HS algorithm.

Download Full-text