A MILP and local search heuristic for meal production scheduling: optimizing performance in Asian-Style restaurants

Information from the abstract

This study addresses meal production scheduling in an Asian-style restaurant by considering unrelated cooking equipment, non-identical cooking times, sequence-dependent preparation times, and variable customer arrival times. A mixed-integer linear programming (MILP) model is developed to optimize the cooking process and assign dishes to appropriate equipment. The model aims to minimize a weighted combination of 1) maximum customer waiting time, 2) total customer waiting time, 3) makespan, and 4) total processing time. To solve practical-scale scheduling problems, a heuristic algorithm based on a local search approach is proposed. Computational experiments show that, for small-scale problems for which the MILP model reaches an optimal solution, the proposed heuristic yields near-optimal performance. However, as problem complexity increases, the heuristic significantly outperforms the MILP model solved using LINGO under a four-hour time limit, highlighting its practical applicability for real-time implementation in fast-paced restaurant kitchens.

Why this record is monitored

This record has an Impact Signal of 71/100 based on recency, source, collaboration, and bibliographic signals. It prioritizes monitoring and is not a judgment of research quality.

Related topics: Scheduling and Optimization Algorithms · Optimization and Mathematical Programming · Scheduling and Timetabling Solutions