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...
保存先:
主要な著者: | Bennell, Julia A., Lee, Lai Soon, Potts, Chris N. |
---|---|
フォーマット: | 論文 |
言語: | 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/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
A genetic algorithm for symmetric travelling salesman problem eith due dates
著者:: Lee, Lai Soon, 等
出版事項: (2007) -
A Genetic Algorithm for Two-Dimensional Bin Packing Problem
著者:: Lee, Lai Soon
出版事項: (2008) -
A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem
著者:: Sarabian, Maryam, 等
出版事項: (2010) -
Heuristic for oriented two-dimensional bin packing problem
著者:: Wong, Lily, 等
出版事項: (2009) -
Heuristic placement routines for two-dimensional bin packing problem.
著者:: Wong, L., 等
出版事項: (2009)