A genetic algorithm for two-dimensional bin packing with due dates
This paper considers a new variant of the two-dimensional bin packing problem where each rectangle is assigned a due date and each bin has a fixed processing time. Hence the objective is not only to minimize the number of bins, but also to minimize the maximum lateness of the rectangles. This proble...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Article |
| 语言: | English English |
| 出版: |
Elsevier
2013
|
| 在线阅读: | http://psasir.upm.edu.my/id/eprint/30331/1/A%20genetic%20algorithm%20for%20two.pdf http://psasir.upm.edu.my/id/eprint/30331/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|