Two-machine flow shop total tardiness scheduling problem with deteriorating jobs |
| |
| Authors: | M. Bank S.M.T. Fatemi Ghomi F. Jolai J. Behnamian |
| |
| Affiliation: | 1. Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311 Tehran, Iran;2. Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| |
| Abstract: | This paper studies a two-machine scheduling problem with deteriorating jobs which their processing times depend on their waiting time. We develop a branch and bound algorithm to minimize the total tardiness criteria. A lower bound, several dominance properties and an initial upper bound derived from a heuristic algorithm are used to increase the speed of branch and bound algorithm and decrease its required memory space. Computational results are presented to evaluate effectiveness and efficiency of the algorithms. |
| |
| Keywords: | Flow shop Scheduling Deteriorating job Branch and bound algorithm Heuristic algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
