Next Article in Journal
Determinization and Minimization of Automata for Nested Words Revisited
Previous Article in Journal
Detection of Representative Variables in Complex Systems with Interpretable Rules Using Core-Clusters
Previous Article in Special Issue
Person Re-Identification across Data Distributions Based on General Purpose DNN Object Detector
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

1
Nara Institute of Science and Technology, Nara 630-0192, Japan
2
Graduate School of Information Science and Technology, Osaka University, Osaka 565-0871, Japan
3
Institute of Physical and Chemical Research, Center for Advanced Intelligence Project (AIP), Tokyo 103-0027, Japan
*
Author to whom correspondence should be addressed.
Algorithms 2021, 14(2), 67; https://doi.org/10.3390/a14020067
Submission received: 13 January 2021 / Revised: 16 February 2021 / Accepted: 18 February 2021 / Published: 23 February 2021
(This article belongs to the Special Issue Feature Papers in Algorithms for Multidisciplinary Applications)

Abstract

As the number of users who cook their own food increases, there is increasing demand for an optimal cooking procedure for multiple dishes, but the optimal cooking procedure varies from user to user due to the difference of each user’s cooking skill and environment. In this paper, we propose a system of presenting optimal cooking procedures that enables parallel cooking of multiple recipes. We formulate the problem of deciding optimal cooking procedures as a task scheduling problem by creating a task graph for each recipe. To reduce execution time, we propose two extensions to the preprocessing and bounding operation of PDF/IHS, a sequential optimization algorithm for the task scheduling problem, each taking into account the cooking characteristics. We confirmed that the proposed algorithm can reduce execution time by up to 44% compared to the base PDF/IHS, and increase execution time by about 900 times even when the number of required searches increases by 10,000 times. In addition, through the experiment with three recipes for 10 participants each, it was confirmed that by following the optimal cooking procedure for a certain menu, the actual cooking time was reduced by up to 13 min (14.8% of the time when users cooked freely) compared to the time when users cooked freely.
Keywords: cooking; optimization; algorithm; task scheduling problem cooking; optimization; algorithm; task scheduling problem

Share and Cite

MDPI and ACS Style

Nakabe, J.; Mizumoto, T.; Suwa, H.; Yasumoto, K. Optimal Cooking Procedure Presentation System for Multiple Recipes and Investigating Its Effect. Algorithms 2021, 14, 67. https://doi.org/10.3390/a14020067

AMA Style

Nakabe J, Mizumoto T, Suwa H, Yasumoto K. Optimal Cooking Procedure Presentation System for Multiple Recipes and Investigating Its Effect. Algorithms. 2021; 14(2):67. https://doi.org/10.3390/a14020067

Chicago/Turabian Style

Nakabe, Jin, Teruhiro Mizumoto, Hirohiko Suwa, and Keiichi Yasumoto. 2021. "Optimal Cooking Procedure Presentation System for Multiple Recipes and Investigating Its Effect" Algorithms 14, no. 2: 67. https://doi.org/10.3390/a14020067

APA Style

Nakabe, J., Mizumoto, T., Suwa, H., & Yasumoto, K. (2021). Optimal Cooking Procedure Presentation System for Multiple Recipes and Investigating Its Effect. Algorithms, 14(2), 67. https://doi.org/10.3390/a14020067

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop