This paper focuses on the problem of determining locations for long-term care facilities with the objective of balancing the numbers of patients assigned to the facilities. We present a branch and bound algorithm by developing dominance properties, a lower bounding scheme and a heuristic...

We consider a multi-period vehicle scheduling problem (MPVSP) in a transportation system where a fleet of homogeneous vehicles delivers products of a single type from a central depot to multiple (N) retailers. The objective of the MPVSP is to minimize transportation costs for product delivery...

We present a branch and bound algorithm for a two-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1,...

In this paper, we consider the fire scheduling problem (FSP) for field artillery, which is the problem of scheduling operations of firing at given targets with a given set of weapons. We consider a situation in which the number of available weapons is smaller than the number of targets, the...

In this study, we consider a two-level supply chain in which a supplier serves a group of retailers in a given geographic region and determines a replenishment plan for each retailer by using the information on demands of final customers and inventory levels of the retailers. Deliveries are...

In this research, we examine the impact of a third-party warehouse on the bullwhip effect in a three-stage supply chain with one supplier, one third-party warehouse and two retailers. We compare the bullwhip effect in this three-stage supply chain and that in a two-stage supply chain with only...