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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | 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/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|