Total Time Minimizing Transportation Problem
Ilija Nikolić (2007)
The Yugoslav Journal of Operations Research
Similarity:
Ilija Nikolić (2007)
The Yugoslav Journal of Operations Research
Similarity:
Adlakha, V., Arsham, H. (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
C. C. Tsouros, M. Satratzemi (1994)
The Yugoslav Journal of Operations Research
Similarity:
Kalpana Dahiya, Vanita Verma (2006)
The Yugoslav Journal of Operations Research
Similarity:
Dorota Kuchta (2007)
Control and Cybernetics
Similarity:
Ritu Narang, S.R. Arora (2009)
The Yugoslav Journal of Operations Research
Similarity:
Miao-Sheng Chen, Chun-Hsiung Lan (2002)
The Yugoslav Journal of Operations Research
Similarity:
Nabil Absi, Safia Kedad-Sidhoum (2007)
RAIRO - Operations Research
Similarity:
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons...
Flood, Joe (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity: