Abstract
AbstractIn this work, we study the optimization model for a permutation flow shop scheduling problem with sequence-independent setup time and total flow time. The objective here is to minimize the total completion time for all jobs, namely the total flow time. The constraint of our study is the sequence-independent setup time (SIST) which means that the setup time will depend on the nature of the machine. To solve this problem, we suggest three methods: an exact mixed-integer linear programming (MILP) method; two heuristics, the first one is based on Johnson’s rule while the second is based on the NEH algorithm. It was established that the second NEH based heuristic numerical method gives best results than the first based on Johnson.KeywordsFlow shop schedulingSISTMILPTotal flow timeHeuristic
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
