Due windows group scheduling using an effective hybrid optimization approach

作者：Behnamian J; Zandieh M^*; Ghomi S M T Fatemi

来源：International Journal of Advanced Manufacturing Technology, 2010, 46(5-8): 721-735.

DOI：10.1007/s00170-009-2147-z

• Group scheduling
• Hybrid flow shops
• Due window scheduling
• Hybrid metaheuristic
• Particle swarm optimization
• Variable neighborhood
• Simulated annealing

This paper considers the problem of scheduling part families (groups) and jobs within each part family in a hybrid flow shop manufacturing cell with sequence-dependent family setups times where jobs should be completed at times as close as possible to their respective due dates, and hence both earliness and tardiness should be penalized while processing parts (jobs) in each family together. It is assumed that earliness and tardiness penalties will not occur if a job is completed within the due The objective is to determine a schedule that minimizes sum of the earliness and tardiness of jobs. To this problem, the hybrid metaheuristic algorithm combined elements from particle swarm optimization; simulated annealing and variable neighborhood search are developed. The aim of using a hybrid metaheuristic is to raise the level of generality so as to be able to apply the same solution method to several problems. Problem sizes ranging in size from small, medium, to large are considered along with three levels of flexibility. The higher the number of stages and the number of parallel machines in each stage, the higher is the flexibility introduced into the problem. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. We present computational experiments on 126 problems and compare the results with the simulated annealing and genetic algorithms that presented recently. The computational results show that our proposed algorithm is more efficient than the other methods.

• 出版日期2010-1