Solving Constrained Flow-Shop Scheduling
Problems with Three Machines
Flow-shop scheduling problem; Transportation time; Weights of jobs;
Optimal sequence.
A new method is proposed to obtain an optimal scheduling sequence
for flow-shop scheduling problems involving transportation time, break down time
and weights of jobs (constrained flow-shop scheduling problems) with 3-machines.
The proposed method is very simple and easy to understand and also, provides an
important tool for decision makers when theydesign a scheduling for constrained
flow-shop scheduling problems with 3 machines. The proposed method is illustrated
with help of numerical examples.