| Article ID: | iaor20021095 |
| Country: | China |
| Volume: | 19 |
| Issue: | 4 |
| Start Page Number: | 35 |
| End Page Number: | 38 |
| Publication Date: | Aug 2000 |
| Journal: | Journal of Lanzhou Railway University |
| Authors: | Chen Youming, Chen Guangxi |
Taking a class arrangement as an example, we give a new combinatorial algorithm for multitask planning under given resources and discuss its implementation with the LISP programming language.