In designing Global Positioning System (GPS) surveying network, a given set of earth points must be observed consecutively (schedule). The cost of the schedule is the sum of the time needed to go from one point to another. The problem is to search for the best order in which this observation is executed. Minimizing the cost of this schedule is the goal of this work. Solving the problem for larg...

This paper describes an actual aircraft maintenance labor scheduling study. The study's objective is to determine the optimum maintenance workforce schedule to satisfy growing labor requirements with minimum cost. The main recommendation of the study is to switch from a five-day to a seven-day workweek for aircraft maintenance workers. A new integer programming formulation, used to obtain an op...

We consider the open shop, job shop, and ow shop scheduling problems with integral processing times. We give polynomial-time algorithms to determine if an instance has a schedule of length at most 3, and show that deciding if there is a schedule of length at most 4 is N P-complete. The latter result implies that, unless P = N P, there does not exist a polynomial-time approximation algorithm for...

This paper addresses the problem of maintaining the consistency of a pre-defined schedule during its execution in a real or simulated environment. This issue, referred to as Reactive Scheduling Problem, is known to be inherently difficult due to the usually strict timelines in which the revising procedure is called to react. Schedule revision must be quick, and sometimes solution quality must c...

OBJECTIVE The aim of this study was to assess effectiveness of an alternative, 24-hr-on/72-hr-off watchstanding schedule on sleep and morale of personnel assigned to the President's Emergency Operations Center (PEOC). BACKGROUND As part of the White House Military Office, PEOC personnel historically worked a 12-hr "Panama" watch schedule. Personnel reported experiencing chronic insufficient a...