Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Business

Series

Singapore Management University

Logistics

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song Aug 2005

Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song

Research Collection School Of Computing and Information Systems

The models for multi-echelon inventory systems in existing literatures predominantly address failures due to reliability in peacetime. In wartime or even peacetime operational scenarios, unexpected combat damage can cause a large number of systems to be heavily damaged, to the extent that they become irreparable. In this paper, we study a multi-echelon spare parts support system under combat damage, discuss the replenishment policy and propose an approximate method to evaluate the time-varying system performance operational availability considering the effect of passivation. Experiments show our model works well and efficiently against simulation.


Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim May 2004

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim

Research Collection School Of Computing and Information Systems

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 properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.