A GA-Based Heuristic Algorithm for Two-Machine Robotic Flow-Shop Scheduling Problem with Make Span

ICLEM 2010 ◽  
2010 ◽  
Author(s):  
Juntao Li ◽  
Takashi Uehata ◽  
Yoshiyuki Karuno ◽  
Hiroshi Kise
Keyword(s):  
Heuristic Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

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.

Alternative Heuristic Algorithm for Flow Shop Scheduling Problem

2013 ◽  
pp. 277-297
Author(s):  
Vladimír Modrák ◽  
R. Sudhakra Pandian ◽  
Pavol Semanco
Keyword(s):  
Heuristic Algorithm ◽  
Flow Shop ◽  
Idle Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Realistic Situation ◽  
Permutation Flow Shop

In this chapter an alternative heuristic algorithm is proposed that is assumed for a deterministic flow shop scheduling problem. The algorithm is addressed to an m-machine and n-job permutation flow shop scheduling problem for the objective of minimizing the make-span when idle time is allowed on machines. This chapter is composed in a way that the different scheduling approaches to solve flow shop scheduling problems are benchmarked. In order to compare the proposed algorithm against the benchmarked, selected heuristic techniques and genetic algorithm have been used. In realistic situation, the proposed algorithm can be used as it is without any modification and come out with acceptable results.

A Heuristic Algorithm for Flow Shop Scheduling Problem

2014 ◽  
Vol 643 ◽  
pp. 374-379
Author(s):  
Hua Wei Yuan ◽  
Yuan Wei Jing ◽  
Tao Ren
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Numerical Experiments ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Large Size ◽  
Flow Shop Problem ◽  
Weighted Completion Time

This paper considers the m-machine flow shop problem to minimize weighted completion time. A heuristic algorithm is presented to deal with the problem for large size problem. At the end of the paper, some numerical experiments show the effectiveness of the heuristic.

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.

Sign in / Sign up

Export Citation Format

Share Document