Minimization of total waiting time of jobs in n 2 specially structured Flow Shop Scheduling with set up time separated from processing time and each associated with probabilities

Basic Flow shop scheduling is converted to three stage flow shop scheduling, this paper describes waiting time of jobs on Specially Structured machines aimed at minimizing total waiting time of ‘n’ jobs when the number of machines (or processing stations) is ‘3’. The problem discussed has wider applicability and has better practical usage when it comes to reducing the overall waiting time of scheduled jobs. The objective of the observation is to bring forth the arrangement/sequence of jobs associated with the least amount of total waiting time using iterative algorithm. The application of the algorithm is universal under given constraints discussed here. Furthermore, a practical example is discussed step by step to clarify the application of the algorithm.

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

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