Solution of the generalized Townsend single machine scheduling model |
| |
| Affiliation: | 1. Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai 980-8579, Japan;2. Department of Computer Science, Gunma University, Kiryu 376-8515, Japan;3. Department of Communication Engineering and Informatics, University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo 182-8585, Japan;4. School of Information Science, Japan Advanced Institute of Science and Technology, Asahidai 1-1, Nomi, Ishikawa 923-1292, Japan;5. Principles of Informatics Research Division, National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan;6. Graduate School of Science, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai 599-8531, Japan;1. School of Science, Nantong University, Nantong, Jiangsu, 226019, China;2. School of Mathematics and Statistics, Central South University, Changsha, Hunan, 410083, China;3. Faculty of Science, University of Kragujevac, Kragujevac, Serbia;4. State University of Novi Pazar, Novi Pazar, Serbia;1. Department of Mathematics and Statistics, York University, Toronto, Canada;2. CNRS & LIX, École Polytechnique, Palaiseau, France |
| |
| Abstract: | The paper deals with the generalized version of Townsend's n-job single machine scheduling model. It shows that the model is highly decomposable for n = 20, 50 and 100 when all its parameters are drawn from the same uniform distribution. It identifies a less decomposable version and provides an improved branching method to solve it. This method is tested on problems of size n = 20 and 50 on a PC and n = 100 on a mainframe computer. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
