A Simultaneous Worker Assignment and Scheduling Problem for Minimizing Makespan in Flexible Flow Shop Via Metaheuristic Approaches
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 30، Issue: 2
Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 313
This Paper With 18 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-30-2_007
تاریخ نمایه سازی: 3 اسفند 1398
Abstract:
In many real scheduling situations, it is necessary to deal with the worker assignment and job scheduling together. However, in traditional scheduling problems, only the machine is assumed to be a constraint, and there is not any constraint about workers. This assumption could, in part, be due to the lower cost of workers compared to machines or the complexity of workers assignment problems. This research proposes a flexible flow shop scheduling problem with two simultaneous issues: finding thebest worker assignment and solving the corresponding scheduling problem. A mathematical model that extends a flexible flow shop scheduling problem is presented to admit the worker assignment. Due to the NP-hardness of the research problem, two approximation approaches based on particle swarm optimization, named PSO and SPSO, are applied to minimize the makespan. The experimental results show that the proposed algorithms can efficiently minimize the makespan; however, the SPSO generates better solutions, especially for large-sized problems
Keywords:
Authors
Fatemeh Bozorgnezhad
MSc student of industrial engineering; Babol Noshirvani University of Technology; Babol; Iran.
Ebrahim Asadi-Gangraj
Assistant professor of industrial engineering; Babol Noshirvani University of Technology; Babol; Iran.
Mohammad Mahdi Paydar
Assistant professor of industrial engineering; Babol Noshirvani University of Technology; Babol; Iran.