مشخصات پژوهش

صفحه نخست /A general flow shop ...
عنوان
A general flow shop scheduling problem with consideration of position based learning effect and multiple availability constraints
نوع پژوهش مقاله چاپ‌شده
کلیدواژه‌ها
Scheduling, Non-permutation flowshop, Learning effect, Availability constraint, Heuristicmethod
چکیده
In this paper, a more general version of the flowshop scheduling problem with the objective of minimizing the total flow time is investigated. In order to get closer to the actual conditions of the problem, some realistic assumptions including non-permutation scheduling, learning effect, multiple availability constraints, and release times are considered. It is assumed that the real processing time of each job on a machine depends on the position of that job in the sequence, and after processing a specified number of jobs at each machine, an unavailability period is occurring because of maintenance activities. Moreover, it is supposed that each job may not be ready for processing at time zero and may have a release time. According to these assumptions, a new mixed integer linear programming (MILP) model is proposed to formulate the problem. Due to the high complexity of the problem, a heuristic method and a simulated annealing algorithm are presented to find the nearly optimal solutions for medium- and large-sized problems. To obtain better and more robust solutions, the Taguchi method is used in order to calibrate the simulated annealing algorithm parameters. Finally, the computational results are provided for evaluating the performance and effectiveness of the proposed solution methods.
پژوهشگران