Minimizing Completion Time Variance in a Flowshop Scheduling Problem with a Learning Effect
[ X ]
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Gazi Univ
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
In this paper, flowshop scheduling problem with a learning effect is considered. The objective function of the problem is minimizing completion times variance. A non-linear programming model is developed for the problem. Also the model is tested on an example. Results of computational tests show that the proposed model is effective in solving problems with up to 30 jobs. The overall average solution error of the heuristic algorithm is 2 %. Processing of the 30 jobs case requires only 0.1 s on average to obtain an ultimate or even optimal solution. To solve the large sizes problems up to 500 jobs, heuristics methods were used. The performances of heuristics about the solution error were evaluated with the non-linear programming model results for small size problems and each other for large size problems. According to results, the special heuristic for all number of jobs was the more effective than others. The heuristic scheduling algorithm is more practical to solve real world applications than the non-linear programming model.
Description
Keywords
flowshop scheduling; learning effect; completion time variance; non-linear programming model; heuristic methods
Journal or Series
Gazi University Journal of Science
WoS Q Value
N/A
Scopus Q Value
Q2
Volume
26
Issue
3
