Scheduling workers in a constricted area

✍ Scribed by J. Brimberg; W. J. Hurley; R. E. Wright

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 446 KB
• Volume: 43
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/(sici)1520-6750(199602)43:1<143::aid-nav9>3.0.co;2-b

✦ Synopsis

A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space-tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms form = 2 and 3.