Use of a branch and bound algorithm to schedule food production in a semi-conventional food service system
1982
Stinson, Joel P. | Guley, Helen M.
Extract: A new computerized technique for solving the problem of production scheduling in a semi-conventional food service system was found to be a branch and bound algorithm. The primary objective was to minimize, on a daily basis, the overall time required for noon-time meal production (from the start of hot food preparation to the completion of all menu items). The 2nd objective was to produce right-shifted schedules (so that all menu items would be completed as close to meal time as possible) through modification of the algorithm. Benefits of the computerized procedure include increased productivity through the more efficient utilization of resources and the enhancement of nutritional, organoleptic and microbiological properties of foods. (author)
显示更多 [+] 显示较少 [-]