Flexible Flowshop Scheduling Model with Four Stages

Pharmaceutical Scheduling Using Simulated Annealing and Steepest Descent Method

“…Consider ten jobs and four stages, with each stage having 4 parallel, uniform machines (Table VII) (Tyagi, 2016).…”

“…The Construction Algortihm used (Tyagi, 2016) assigned to these four separate problems using MPTSA (Tyagi, 2016). LPT is then used in each individual flowshop to schedule the respective jobs.…”

“…The makespan of 34 is calculated using the maximum of each of the four flowshops. (Tyagi, 2016) in descending order. The slope Yi for n th jobs (i=1 to n) for every category of the flow shop scheduling ( ) on each machine center stage ( ) is as follows:…”

“…Solution 3 8 10 4 7 1 9 2 6 5 of Illustrative Example 2 8 3 10 4 7 1 9 2 6 5 10 8 3 4 7 1 9 2 6 5 4 8 10 3 7 1 9 2 6 5 7 8 10 4 3 1 9 2 6 5 1 8 10 4 7 3 9 2 6 5 9 8 10 4 7 1 3 2 6 5 2 8 10 4 7 1 9 3 6 5 6 8 10 4 7 1 9 2 3 5 5 8 10 4 7 1 9 2 6 3 3 10 8 4 7 1 9 2 6 5 3 4 10 8 7 1 9 2 6 5 3 7 10 4 8 1 9 2 6 5 3 1 10 4 7 8 9 2 6 5 3 9 10 4 7 1 8 2 6 5 3 2 10 4 7 1 9 8 6 5 3 6 10 4 7 1 9 2 8 5 3 5 10 4 7 1 9 2 6 8 3 8 4 10 7 1 9 2 6 5 3 8 7 4 10 1 9 2 6 5 3 8 1 4 7 10 9 2 6 5 3 8 9 4 7 1 10 2 6 5 3 8 2 4 7 1 9 10 6 5 3 8 6 4 7 1 9 2 10 5 3 8 5 4 7 1 9 2 6 10 3 8 10 7 4 1 9 2 6 5 3 8 10 1 7 4 9 2 6 5 3 8 10 9 7 1 4 2 6 5 3 8 10 2 7 1 9 4 6 5 3 8 10 6 7 1 9 2 4 5 3 8 10 5 7 1 9 2 6 4 3 8 10 4 1 7 9 2 6 5 3 8 10 4 9 1 7 2 6 5 3 8 10 4 2 1 9 7 6 5 3 8 10 4 6 1 9 2 7 5 3 8 10 4 5 1 9 2 6 7 3 8 10 4 7 9 1 2 6 5 3 8 10 4 7 2 9 1 6 5 3 8 10 4 7 6 9 2 1 5 3 8 10 4 7 5 9 2 6 1 3 8 10 4 7 1 2 9 6 5 3 8 10 4 7 1 6 2 9 5 3 8 10 4 7 1 5 2 6 9 3 8 10 4 7 1 9 6 2 5 3 8 10 4 7 1 9 5 6 2 3 8 10 4 7 1 9 2 5 6 In this study, SA solved the illustrative examples using a very small amount of computation time (<0.3 seconds). A data error was found in the example problem of Tyagi (2016) which was corrected so the solutions could be compared. SD did not improve upon the solutions found by SA.…”