John Powell, chief of airport security at a large Canadian airport, is responsible for scheduling security...

 

Transcribed Image Text:

John Powell, chief of airport security at a large Canadian airport, is responsible for scheduling security agents around the clock. Powell has divided the day into six 4-hours periods: midnight to 4:00A.M., 4:00A.M. to 8:00A.M., etc. Security agents work 8-hour shifts. Passenger traffic in the airport is determined by domestic and international flight schedules, and Powell has decided that the minimum number of security agents that he needs on duty during the different 4-hour shifts is as shown in the table: Shift Time 6. 4:00P.M. 8:00P.M. Midnight- 4:00A.M. 4:00A.M. 8:00A.M. Noon- -8:00A.M. -4:00P.M. -8:00P.M. | to -noon Minimum number of security agents requested Midnight 12 10 24 24 16 Since Powell has been requested to keep the security budget at a minimum, he needs to minimize the number of security agents who work in the airport in a day, In making up a daily roster of security agents, Powell has to specify the starting time for each agent, therefore he has to decide how many agents should start their 8-hour shift at the beginning of each 4-hour time block. Formulate the security agent scheduling problem as a linear program. Let X,= The number of staffs who start to work at midnight, X= The number of staffs who start to work at 4am, ... X= The number of staffs who start to work at 8pm. At the end of the linear programming, we need to add one constraint "All the variables are Positive Non-negative binary variables Binary variables Non-negative integers John Powell, chief of airport security at a large Canadian airport, is responsible for scheduling security agents around the clock. Powell has divided the day into six 4-hours periods: midnight to 4:00A.M., 4:00A.M. to 8:00A.M., etc. Security agents work 8-hour shifts. Passenger traffic in the airport is determined by domestic and international flight schedules, and Powell has decided that the minimum number of security agents that he needs on duty during the different 4-hour shifts is as shown in the table: Shift Time 6. 4:00P.M. 8:00P.M. Midnight- 4:00A.M. 4:00A.M. 8:00A.M. Noon- -8:00A.M. -4:00P.M. -8:00P.M. | to -noon Minimum number of security agents requested Midnight 12 10 24 24 16 Since Powell has been requested to keep the security budget at a minimum, he needs to minimize the number of security agents who work in the airport in a day, In making up a daily roster of security agents, Powell has to specify the starting time for each agent, therefore he has to decide how many agents should start their 8-hour shift at the beginning of each 4-hour time block. Formulate the security agent scheduling problem as a linear program. Let X,= The number of staffs who start to work at midnight, X= The number of staffs who start to work at 4am, ... X= The number of staffs who start to work at 8pm. At the end of the linear programming, we need to add one constraint "All the variables are Positive Non-negative binary variables Binary variables Non-negative integers

Answer rating: 100% (QA)

ANSWER Binry vribles Binry vribles re vribles tht nly tke tw vlues Fr exmle Mle r Femle True r Flse ... View the full answer