A flexible flowshop problem with total flow time minimization |
| |
| Affiliation: | 1. Industrial Engineering Department, Middle East Technical University, Ankara, Turkey;2. Industrial Engineering Department, Anadolu University, Eskişehir, Turkey;1. Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO 80523, United States;2. Department of Computer Science, Colorado State University, Fort Collins, CO 80523, United States;1. Department of Microelectronics Engineering, National Kaohsiung Marine University, Kaohsiung 811, Taiwan, ROC;2. Department of Electrical Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung 807, Taiwan, ROC;1. State Key Laboratory of Electroanalytical Chemistry, Changchun Institute of Applied Chemistry, Chinese Academy of Sciences, 5625 Renmin Street, Changchun 130022, China;2. University of Chinese Academy of Sciences, Beijing 100049, China;3. State Key Laboratory of Polyme Physics and Chemistry, Changchun Institute of Applied Chemistry, Chinese Academy of Sciences, China;4. Faculty of Engineering, Yamagata University, Jyonan 4-3-16, Yonezawa 992-8510, Japan;5. Changzhou Institute of Energy Storage Materials & Devices, 9 Hehai Eastern Road, Changzhou 213000, China;1. Institute of Operations Research, School of Management, Qufu Normal University, Rizhao 276826, China;2. Department of Mechanical and Industrial Engineering, Concordia University, Montreal H3G 1M8, Canada;3. School of Management, Tianjin University of Technology, Tianjin 300384, China |
| |
| Abstract: | In this study, we consider total flow time problem in a flexible flowshop environment. We develop a branch and bound algorithm to find the optimal schedule. The efficiency of the algorithm is enhanced by upper and lower bounds and a dominance criterion. Computational experience reveals that the algorithm solves moderate sized problems in reasonable solution times. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
