We describe a method to find low cost employee shift schedules that guarantee that the fraction of customers who wait less than a specified time (the service level) is always at or above a specified minimum. Most previous approaches used a two-step procedure: (1) determine period-by-period...

In this paper, we propose a new method for partitioning a graph into an unspecified number of Hamiltonian subgraphs with minimum and maximum size requirements on the subgraphs. We refer to this problem as the cardinality constrained covering traveling salesman problem (CCC-TSP). Special cases of...

The Local Area Network (LAN) Implementation Project Life Cycle Model presented in this paper integrates various checklists of LAN specific implementation considerations with the critical success factors (CSFs) associated with the various stages of the project life cycle. This model addresses the...

Geographical Information Systems (GIS) involve the manipulation of large spatial data sets, and the performance of these systems is often determined by how these data sets are organized on secondary storage (disk). This paper describes a simulation study investigating the performance of two...

Scope and Purpose – For solving combinatorial optimization problems, neural networks have traditionally been outperformed by traditional heuristic techniques developed specifically for the problem in question. This research is a step toward integrating the problem specific knowledge embedded...