Optimal Scheduiing of Two Consecutive Idle Periods

It is shown that a simple algorithm provides optimal solutions to problems of scheduling men or equipment to meet cyclic requirements over periods where each man or machine must be idle for two consecutive periods per cycle. An example illustrates the application to scheduling to meet seven distinct daily requirements per week using employees for five consecutive work days.

• 저널Management Science · 19(1) · 71–75
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.19.1.71
• 저자Rajen Tibrewala, D. Philippe, James J. Browne