An approach to cooking process scheduling for a family restaurant

Abstract

The quality of service at restaurants depends not only on the quality of dishes served but also on the waiting time and the timing of when the dishes are provided. For high quality service, scheduling the cooking processes of the ordered dishes is needed. This scheduling problem can be regarded as a kind of job shop scheduling. When many orders pour in at about the same time, and when the number of dishes requiring serving increases, arranging the cooking processes so as to keep the quality of food and service becomes difficult. This paper clarifies a cooking process scheduling model and establishes a basic algorithm. This cooking process scheduling needs to be online because it decides which cooking process is executed at the time when a cook becomes idle or new orders are received. Thus, we use dispatching rules that evaluate the priorities of all jobs not yet executed and that select one job to start next. We first compare dispatching rules for four pieces of order information taken from actual orders by customers. The result showed that the SLACK rule performed superiorly for our order information. We next propose three scheduling methods, taking account of slightly prospective situations in order to make a preferred schedule in which multiple dishes are served at the same time for the same table. The proposed methods worked well for the service of providing dishes at the same time for our data, although the effectiveness of the proposed methods was greatly influenced by the characteristics of the order information.

Optimal Cooking Procedure Presentation System for Multiple Recipes and Investigating Its Effect

“…As the proposed app does not perform unsearchable parallelization or necessary washing, it is considered inappropriate for comparison. On the other hand, using the proposed app properly reduced the substantial total cooking time of half of the experimental participants (ID = 1, 6,7,8,11). This is because our proposed system assigned parallel cooking and washing tasks to the gaps that were not utilized when cooking as usual (Figure 9).…”

“…They considered cooking as an extension of the resource constrained project scheduling problem (RCPSP) by viewing cooking tasks and cooks to be assigned as jobs and machines, respectively, and used SA to determine the cooking procedure. There are other studies to search for efficient cooking procedures, such as the creation of cooking models and the job-shop scheduling problem (JSP) [7][8][9], but these studies do not consider the washing task. In addition, previous studies assigned the cook as a machine, in theory, each cooking task can be performed when the cook is assigned.…”

Minimal Degree of Freedom Dual-Arm Manipulation Platform with Coupling Body Joint for Diverse Cooking Tasks

“…These primary constraint conditions used are commonly identified as a job-shop scheduling problem (JSSP). Although it is not the first time JSSPs have been applied to cooking activities [12], it is the first to our knowledge being applied to a fully automated kitchen. However the constraints set by JSSPs alone are not enough to fully encompass the automation required by our system.…”

A Dish Scheduling Model for Traditional Chinese Restaurants Based on Hybrid Multiple Criteria Decision-Making Algorithms and a Double-Layer Queuing Structure

“…Nakabe et al [6] optimized the cooking procedure with the extended parallelized depth first/implicit heuristic search (PDF/IHS) to reduce the cooking time. Kimura et al [7] investigated an approach to schedule cooking in a family restaurant.…”