Minimizing makespan in a two-machine flow shop with effects of deterioration and learning |
| |
Authors: | Ji-Bo Wang P. Ji T. C. E. Cheng Dan Wang |
| |
Affiliation: | 1. School of Science, Shenyang Aerospace University, Shenyang, 110136, China 2. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong 3. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
|
| |
Abstract: | We consider a two-machine flow shop scheduling problem with effects of deterioration and learning. By the effects of deterioration and learning, we mean that the processing time of a job is a function of its execution starting time and its position in a sequence. The objective is to find a sequence that minimizes the makespan. Several dominance properties and two lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. Two heuristic algorithms are also proposed to obtain near-optimal solutions. Computational results are presented to evaluate the performance of the proposed algorithms. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|