| Article ID: | iaor20171125 |
| Volume: | 29 |
| Issue: | 1 |
| Start Page Number: | 127 |
| End Page Number: | 147 |
| Publication Date: | Mar 2017 |
| Journal: | International Journal of Operational Research |
| Authors: | Gupta Deepak, Sharma Sameer, Nailwal Kewal Krishan |
| Keywords: | scheduling, combinatorial optimization, programming: multiple criteria, heuristics |
Flow shop scheduling with sequence‐dependent setup time is the most complicated case of scheduling of jobs. The operational cost of machines is related to the setup time required for processing of jobs on different machines. To express the randomness probabilities are associated with processing times of different attributes on given machines. The objective is to schedule n‐jobs on m‐machines to minimise operational cost of machines subject to minimum total elapsed time of jobs in a flow shop whenever the setup times on machines are sequence‐dependent. As the problem is NP‐hard, a heuristic algorithm is proposed to find the latest time so as to reduce operating time and hence the operational cost with minimum makespan. A numerical example is also given to substantiate the algorithm.