Optimization of the distributed permutation flowshop scheduling problem

dc.contributor.authorAli, Arshad
dc.contributor.examiningcommitteePing, Qingjin (Mechanical Engineering) Appadoo, Srimantoorao S. (Supply Chain Management)en_US
dc.contributor.supervisorElMekkawy, Tarek (Mechanical Engineering) Gajpal, Yuvraj (Supply Chain Management)en_US
dc.date.accessioned2020-04-01T13:23:25Z
dc.date.available2020-04-01T13:23:25Z
dc.date.copyright2020-03-31
dc.date.issued2020-03en_US
dc.date.submitted2020-04-01T03:58:06Zen_US
dc.degree.disciplineMechanical Engineeringen_US
dc.degree.levelMaster of Science (M.Sc.)en_US
dc.description.abstractThere are (n!)m possible solutions for scheduling jobs in a flowshop. Keeping the same schedule for all machines of a factory, brings possible solutions to n!. That’s the reason of knowing this problem as permutation flowshop scheduling problem. In case of distributed permutation flowshop, F possible permutation flowshops are considered for scheduling simultaneously, making it a distributed permutation flowshop scheduling problem (DPFSP). Distributed permutation flowshop scheduling problem consists of solving two problems simultaneously, allocation and sequencing of jobs for each flowshop. In this thesis, distributed permutation flowshop scheduling problem is studied for total flow time and makespan objectives. Additional constraints of no-wait and heterogenous nature of the factories are also considered while solving DPFSP for more realistic problems. The problems are solved by using mathematical model, construction heuristic and tabu search (TS) metaheuristic. Addition of insertion cost matrix and improvement scheme helped achieve improved results for the problems. Extensive numerical experiments are conducted to illustrate the efficiency and validity of proposed algorithms. The solutions of problems are useful to the decentralized, geographically scattered plants. It may help reduce manufacturing cost, organizational risk and can help improve quality of products. Current research improved results by 0.167% for homogeneous DPFSP problem with total flow time objective. Similarly, improved results by 4.77% for no-wait heterogenous DPFSP problem with makespan objective.en_US
dc.description.noteMay 2020en_US
dc.identifier.urihttp://hdl.handle.net/1993/34618
dc.language.isoengen_US
dc.rightsopen accessen_US
dc.subjectparallel flowshop, distributed permutation flowshop, tabu search, total completion time, makespan, no-wait heterogenous DPFSPen_US
dc.titleOptimization of the distributed permutation flowshop scheduling problemen_US
dc.title.alternativeparallel flowshop, distributed permutation flowshop, tabu search, total completion time, makespan, no-wait heterogenous DPFSPen_US
dc.typemaster thesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Ali_Arshad.pdf
Size:
2.75 MB
Format:
Adobe Portable Document Format
Description:
Thesis
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.2 KB
Format:
Item-specific license agreed to upon submission
Description: