Multi-Period Multi-Dimensional Knapsack Problem and Its Application to Available-to-Promise
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these propertie...
محفوظ في:
المؤلفون الرئيسيون: | LAU, Hoong Chuin, LIM, M. K. |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2004
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/1127 https://ink.library.smu.edu.sg/context/sis_research/article/2126/viewcontent/ISS04_ATP.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Multiple knapsack problem with inter-related items and its applications to real world problems
بواسطة: ANG JUAY CHIN
منشور في: (2010) -
Multi-population ant colony algorithm for virtual machine deployment
بواسطة: Sun, Xuemei, وآخرون
منشور في: (2018) -
Applying metaheuristics to feeder bus network design problem
بواسطة: KUAN SZE NEE
منشور في: (2010) -
Compressed representation for higher-level meme space evolution : a case study on big knapsack problems
بواسطة: Feng, Liang, وآخرون
منشور في: (2021) -
Pickup and delivery problem with time windows: Algorithms and test case generation
بواسطة: LAU, Hoong Chuin, وآخرون
منشور في: (2001)