Scheduling Batch Processing Machine Using Max–Min Ant System Algorithm Improved by a Local Search Method
The problem of minimizing the makespan on single batch processing machine is studied in this paper. Both job sizes and processing time are nonidentical and the processing time of each batch is determined by the job with the longest processing time in the batch. Max–Min Ant System (MMAS) algorithm is...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2018-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2018/3124182 |