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:
| தலைமை எழà¯à®¤à¯à®¤à®¾à®³à®°à¯à®•à®³à¯: | , , |
|---|---|
| வடிவமà¯: | கடà¯à®Ÿà¯à®°à¯ˆ |
| மொழி: | English English |
| வெளியீடபà¯à®ªà®Ÿà¯à®Ÿà®¤à¯: |
Elsevier
2013
|
| நிகழà¯à®¨à®¿à®²à¯ˆ அணà¯à®•à®²à¯: | http://psasir.upm.edu.my/30331/ http://psasir.upm.edu.my/30331/ http://psasir.upm.edu.my/30331/1/A%20genetic%20algorithm%20for%20two.pdf |
| கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•à®³à¯: |
கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯ இணை
கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•à®³à¯ இலà¯à®²à¯ˆ, இநà¯à®¤ கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯à®²à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ பதிவ௠செயà¯à®¯à¯à®™à¯à®•à®³à¯!
|