Scheduling Applications II

TE35.1 The Complexity of Scheduling Customer Orders Thomas A. Roemer, Reza Ahmadi --- UCLA, Anderson Sch., 110 Westwood Plaza, Los Angeles, CA 90095-1481, (troemer@agsm.ucla.edu)

The problem of scheduling customer orders is addressed. Each order¨ requires processing on 2 different machines. An order is completed¨ once both processes are finished. It is shown that minimizing the¨ average completion time is NP-hard in the strong sense.

TE35.2 Analysis of Search Methods for Selecting Weights on Heuristics for Resource Constrained Project Scheduling Julia J. Pet-Edwards, Mahdi Nasereddin, Basma Selim --- Univ. of Central FL, Dept. of IE & Mgmt. Systems, PO Box 162450, Orlando, FL 32816-2450, (edwards@iems.engr.ucf.edu)

We present an exploratory analysis of the efficacy of using a GA¨ over the currently used equal interval search for selecting the best¨ set of weights on heuristics used in resource constrained project¨ scheduling. Experimental results using the Kolish network set and¨ several different scheduling heuristics are presented.

TE35.3 Manpower Scheduling Using Column Generation Kenneth E. Murphy, Anuj Mehrotra --- FL Intl. Univ., Dept. of Dec. Sci., Miami, FL 33199 , (murphyk@servms.fiu.edu)

Column generation is a technique that has been applied for solving¨ large 0-1 programs especially when the entire formulation is not¨ explicitly available. We develop and test a column generation-based¨ method for optimally solving manpower scheduling problems.

TE35.4 Scheduling Jobs at a Grocery Distribution Center as an LP Problem Ralph Sprague --- Northeastern IL Univ., 3516 N Neenah Ave., Chicago, IL 60634 ,

An LP model has been developed that creates a feasible work schedule¨ for a grocery distribution center. It takes into account all the¨ incoming orders and their deadlines, the shifts of the employees,¨ the option of hiring temporary workers and the logistics of the¨ warehouse. The program is designed to create a schedule which¨ requires the least amount of temporary help.