A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times |
| |
| Institution: | 1. Department of Industrial and Management Systems Engineering, Kuwait University P.O. Box 5969, Safat, Kuwait;2. Department of Computer Engineering, Kuwait University P.O. Box 5969, Safat, Kuwait;1. School of Electronics and Computer Science, University of Southampton, SO7 1BJ, UK;2. Department of Electrical Engineering, Center of Excellence on Soft Computing and Intelligent Information Processing, Ferdowsi University of Mashhad, Mashhad, Iran;1. Key Laboratory for Geographical Process Analysis & Simulation, Hubei Province, College of Urban and Environmental Science, Central China Normal University, Wuhan, China;2. Joint Spatial Information Research Laboratory, The Hong Kong Polytechnic University and Wuhan University, Hong Kong and Wuhan, China |
| |
| Abstract: | In this paper, we address the three-machine flowshop scheduling problem. Setup times are considered separate from processing times, and the objective is to minimize total completion time. We show that the three-site distributed database scheduling problem can be modeled as a three-machine flowshop scheduling problem. A lower bound is developed and a dominance relation is established. Moreover, an upper bound is developed by using a three-phase hybrid heuristic algorithm. Furthermore, a branch-and-bound algorithm, incorporating the developed lower bound, dominance relation, and the upper bound is presented. Computational analysis on randomly generated problems is conducted to evaluate the lower and upper bounds, the dominance relation, and the branch-and-bound algorithm. The analysis shows the efficiency of the upper bound, and, hence, it can be used for larger size problems as a heuristic algorithm. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
