Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes |
| |
| Affiliation: | 1. School of Computer Science and Technology, Xidian University, Xi’an, China;2. School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an, China;3. School of Software, Xidian University, Xi’an, China;1. School of Information Science & Engineering, Central South University, Changsha, Hunan 410083, China;2. Research Organization of Information and Systems, 4-3-13 Toranomon, Minato-ku, Tokyo 105-0001, Japan;3. The Institute of Statistical Mathematics, 10-3 Midori-cho, Tachikawa, Tokyo 190-8562, Japan;4. Hunan Province Higher Education Key Laboratory of Power System Safety Operation and Control, Changsha University of Science and Technology, Changsha, Hunan 410004, China;5. School of Business, Central South University, Changsha, Hunan 410083, China;6. Collaborative Innovation Center of Resource-Conserving & Environment-Friendly Society and Ecological Civilization, Changsha, Hunan 410083, China;1. International Islamic University, Islamabad, Pakistan;2. Gwangju Institute of Science and Technology, South Korea;1. Department of Economics, Ca’ Foscari University of Venice, Italy;2. Department of Management, Ca’ Foscari University of Venice, Italy |
| |
| Abstract: | This paper proposes an artificial bee colony approach to minimize the makespan for a single batch-processing machine. The single batch-processing problem is characterized by discontinuity in the objective function and having integer variables. Since the problem under study is NP-hard, an artificial bee colony approach is proposed. The penalty function method is used to convert the constrained problem to unconstrained problem, which is then solved by the ABC algorithm. A procedure to generate initial solutions is presented, which is based on filling partially filled batches first. The analysis in the article shows that the colony size, the value of the penalty parameter, the penalty function iteration, the ABC iteration, and maximum trials per food source all have a significant effect on the performance of the ABC algorithm; however, no pattern can be established. |
| |
| Keywords: | Single machine bath processing Non-identical jobs Artificial bee colony heuristic |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
