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...
Saved in:
Main Authors: | LAU, Hoong Chuin, LIM, M. K. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1127 https://ink.library.smu.edu.sg/context/sis_research/article/2126/viewcontent/ISS04_ATP.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Multiple knapsack problem with inter-related items and its applications to real world problems
by: ANG JUAY CHIN
Published: (2010) -
Multi-population ant colony algorithm for virtual machine deployment
by: Sun, Xuemei, et al.
Published: (2018) -
Applying metaheuristics to feeder bus network design problem
by: KUAN SZE NEE
Published: (2010) -
Compressed representation for higher-level meme space evolution : a case study on big knapsack problems
by: Feng, Liang, et al.
Published: (2021) -
Pickup and delivery problem with time windows: Algorithms and test case generation
by: LAU, Hoong Chuin, et al.
Published: (2001)