Authors: S M Mousavi M Zandieh M Yazdani
Publish Date: 2012/06/30
Volume: 64, Issue: 1-4, Pages: 369-388
Abstract
Scheduling is a major issue faced every day in manufacturing systems as well as in the service industry so it is essential to develop effective and efficient advanced manufacturing and scheduling technologies and approaches Also it can be said that bicriteria scheduling problems are classified in two general categories respecting the approach used to solve the problem In one category the aim is to determine a schedule that minimizes a convex combination of two objectives and in the other category is to find a good approximation of the set of efficient solutions The aim of this paper is to determine a schedule for hybrid flowshop problem that minimizes a convex combination of the makespan and total tardiness For the optimization problem a metaheuristic procedure is proposed based on the simulated annealing/local search SA/LS along with some basic improvement procedures The performance of the proposed algorithm SA/LS is compared with a genetic algorithm which had been presented in the literature for hybrid flowshop with the objective of minimizing a convex combination of the makespan and the number of tardy jobs Several computational tests are used to evaluate the effectiveness and efficiency of the proposed algorithm against the other algorithm provided in the literature From the results obtained it can be seen that the proposed algorithm in comparison with the other algorithm is more effective and efficient
Keywords: