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

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 67
Author(s):  
Jin Nakabe ◽  
Teruhiro Mizumoto ◽  
Hirohiko Suwa ◽  
Keiichi Yasumoto
Keyword(s):  
Task Scheduling ◽  
Execution Time ◽  
Cooking Time ◽  
Sequential Optimization ◽  
Task Graph ◽  
Scheduling Problem ◽  
Cooking Skill ◽  
The Difference ◽  
Increasing Demand ◽  
Reduce Execution Time

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.

THE TIME COMPLEXITY OF SCHEDULING INTERVAL ORDERS WITH COMMUNICATION IS POLYNOMIAL

1993 ◽  
Vol 03 (01) ◽  
pp. 53-58 ◽  
Author(s):  
HESHAM H. ALI ◽  
HESHAM EL-REWINI
Keyword(s):  
Execution Time ◽  
Time Complexity ◽  
Linear Time ◽  
Communication Cost ◽  
Interval Order ◽  
Task Graph ◽  
Scheduling Problem ◽  
Interval Orders ◽  
Schedule Length ◽  
Np Complete

Papadimitrjou and Yannakakis showed that unit execution time tasks in interval orders can be scheduled in linear time on N processors when communication cost is ignored. The objective function was to minimize the schedule length. They have also shown that the generalization of this problem to arbitrary execution times is NP- complete . In this paper, we study the problem of scheduling task graphs with communication on N processors when the task graph is an interval order. We prove that this scheduling problem can be solved in polynomial time when the execution cost of the system tasks is identical and equal to the communication cost between any pair of processors. We introduce an algorithm of O(Ne) to minimize the schedule length, where e is the number of arcs in the interval order.

scholarly journals An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures

2009 ◽  
Vol 2009 ◽  
pp. 1-12 ◽  
Author(s):  
F. Redaelli ◽  
M. D. Santambrogio ◽  
S. Ogrenci Memik
Keyword(s):  
Task Scheduling ◽  
Optimal Schedule ◽  
Reconfigurable Architecture ◽  
Reconfigurable Architectures ◽  
Task Graph ◽  
Scheduling Problem ◽  
Physical Constraints ◽  
Schedule Length ◽  
Extended Analysis ◽  
Task Graph Scheduling

This work proposes an exact ILP formulation for the task scheduling problem on a 2D dynamically and partially reconfigurable architecture. Our approach takes physical constraints of the target device that is relevant for reconfiguration into account. Specifically, we consider the limited number of reconfigurators, which are used to reconfigure the device. This work also proposes a reconfiguration-aware heuristic scheduler, which exploitsconfiguration prefetching, module reuse, andantifragmentationtechniques. We experimented with a system employing two reconfigurators. This work also extends the ILP formulation for a HW/SW Codesign scenario. A heuristic scheduler for this extension has been developed too. These systems can be easily implemented using standard FPGAs. Our approach is able to improve the schedule quality by 8.76% on average (22.22% in the best case). Furthermore, our heuristic scheduler obtains the optimal schedule length in 60% of the considered cases. Our extended analysis demonstrated that HW/SW codesign can indeed lead to significantly better results. Our experiments show that by using our proposed HW/SW codesign method, the schedule length of applications can be reduced by a factor of 2 in the best case.

TOP HILL METHOD - A NEW SORTING APPROACH TO REDUCE EXECUTION TIME

2018 ◽  
Vol 12 (4) ◽  
pp. 28
Author(s):  
BHARALI DEBABRAT ◽  
KUMAR SHARMA SANDEEP ◽  
◽  
Keyword(s):  
Execution Time ◽  
Reduce Execution Time

scholarly journals AN EXACT SOLUTION FOR THE RESOURCE-CONSTRAINED CONSTRUCTION SCHEDULING PROBLEM

2016 ◽  
Vol 8 (2) ◽  
pp. 71-78
Author(s):  
Bartłomiej Sroka ◽  
Elżbieta Radziszewska-Zielina
Keyword(s):  
Execution Time ◽  
Critical Path ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Building Projects ◽  
Construction Scheduling ◽  
Program Sample ◽  
Resource Constrained Scheduling Problem ◽  
The Cost ◽  
Exponential Complexity

Reduced time and, by the same token, the cost of the project is a crucial factor in contemporary construction. This article presents a method for the exact optimisation of a resource-constrained scheduling problem. Based on the Critical Path Method, graph theory and linear programming, an algorithm was developed and the FROPT program was written in Matlab to minimise the execution time of the task. By using the newly-created program, sample networks were calculated and the results were compared with results obtained by using the MS Project scheduling program (using approximation algorithm). The execution time obtained by using FROPT were on average 10% shorter than those obtained using MS Project. In selected cases the improvement in execution time reached 25%. A deterministic approach to the problem may shorten planned project times and bring financial benefits. Due to the exponential complexity of the algorithm, it is most useful in solving small or highly coherent networks. The algorithm and program may result in benefits not offered by commercial software for planners of building projects.

scholarly journals Data-Intensive Task Scheduling for Heterogeneous Big Data Analytics in IoT System

Energies ◽  
2020 ◽  
Vol 13 (17) ◽  
pp. 4508
Author(s):  
Xin Li ◽  
Liangyuan Wang ◽  
Jemal H. Abawajy ◽  
Xiaolin Qin ◽  
Giovanni Pau ◽  
...  
Keyword(s):  
Big Data ◽  
Data Analysis ◽  
Task Scheduling ◽  
Execution Time ◽  
Data Centers ◽  
Big Data Analysis ◽  
Data Locality ◽  
Data Migration ◽  
Task Execution ◽  
Task Execution Time

Efficient big data analysis is critical to support applications or services in Internet of Things (IoT) system, especially for the time-intensive services. Hence, the data center may host heterogeneous big data analysis tasks for multiple IoT systems. It is a challenging problem since the data centers usually need to schedule a large number of periodic or online tasks in a short time. In this paper, we investigate the heterogeneous task scheduling problem to reduce the global task execution time, which is also an efficient method to reduce energy consumption for data centers. We establish the task execution for heterogeneous tasks respectively based on the data locality feature, which also indicate the relationship among the tasks, data blocks and servers. We propose a heterogeneous task scheduling algorithm with data migration. The core idea of the algorithm is to maximize the efficiency by comparing the cost between remote task execution and data migration, which could improve the data locality and reduce task execution time. We conduct extensive simulations and the experimental results show that our algorithm has better performance than the traditional methods, and data migration actually works to reduce th overall task execution time. The algorithm also shows acceptable fairness for the heterogeneous tasks.

scholarly journals InterRC: An Inter-Resources Collaboration Heuristic for Scheduling Independent Tasks on Heterogeneous Distributed Environments

MENDEL ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 179-188
Author(s):  
Abdelhamid Khiat ◽  
Abdelkamel Tari
Keyword(s):  
Task Scheduling ◽  
Initial Solution ◽  
Distributed Environments ◽  
Scheduling Problem ◽  
Reasonable Time ◽  
Independent Task ◽  
Np Hard Problem ◽  
Computing Environments ◽  
Scheduling Heuristic ◽  
Independent Tasks

The independent task scheduling problem in distributed computing environments with makespan optimization as an objective is an NP-Hard problem. Consequently, an important number of approaches looking to approximate the optimal makespan in reasonable time have been proposed in the literature. In this paper, a new independent task scheduling heuristic called InterRC is presented. The proposed InterRC solution is an evolutionary approach, which starts with an initial solution, then executes a set of iterations, for the purpose of improving the initial solution and close the optimal makespan as soon as possible. Experiments show that InterRC obtains a better makespan compared to the other efficient algorithms.

scholarly journals Prediksi Pemakaian Listrik Kelompok Tarif Menggunakan Jaringan Syaraf Tiruan dan ARIMA

2013 ◽  
Vol 7 (2) ◽  
pp. 189
Author(s):  
Silviani E Rumagit ◽  
Azhari SN
Keyword(s):  
Neural Network ◽  
Artificial Intelligence ◽  
Neural Networks ◽  
Statistical Method ◽  
Moving Average ◽  
Electric Energy ◽  
Backpropagation Neural Network ◽  
The Difference ◽  
The Government ◽  
Increasing Demand

AbstrakLatar Belakang penelitian ini dibuat dimana semakin meningkatnya kebutuhan listrik di setiap kelompok tarif. Yang dimaksud dengan kelompok tarif dalam penelitian ini adalah kelompok tarif sosial, kelompok tarif rumah tangga, kelompok tarif bisnis, kelompok tarif industri dan kelompok tarif pemerintah. Prediksi merupakan kebutuhan penting bagi penyedia tenaga listrik dalam mengambil keputusan berkaitan dengan ketersediaan energi listik. Dalam melakukan prediksi dapat dilakukan dengan metode statistik maupun kecerdasan buatan.            ARIMA merupakan salah satu metode statistik yang banyak digunakan untuk prediksi dimana ARIMA mengikuti model autoregressive (AR) moving average (MA). Syarat dari ARIMA adalah data harus stasioner, data yang tidak stasioner harus distasionerkan dengan differencing. Selain metode statistik, prediksi juga dapat dilakukan dengan teknik kecerdasan buatan, dimana dalam penelitian ini jaringan syaraf tiruan backpropagation dipilih untuk melakukan prediksi. Dari hasil pengujian yang dilakukan selisih MSE ARIMA, JST dan penggabungan ARIMA, jaringan syaraf tiruan tidak berbeda secara signifikan. Kata Kunci— ARIMA, jaringan syaraf tiruan, kelompok tarif.  AbstractBackground this research was made where the increasing demand for electricity in each group. The meaning this group is social, the household, business, industry groups and the government fare. Prediction is an important requirement for electricity providers in making decisions related to the availability of electric energy. In doing predictions can be made by statistical methods and artificial intelligence.            ARIMA is a statistical method that is widely used to predict where the ARIMA modeled autoregressive (AR) moving average (MA). Terms of ARIMA is the data must be stationary, the data is not stationary should be stationary  use differencing. In addition to the statistical method, predictions can also be done by artificial intelligence techniques, which in this study selected Backpropagation neural network to predict. From the results of tests made the difference in MSE ARIMA, ANN and merging ARIMA, artificial neural networks are not significantly different. Keyword—ARIMA, neural network, tarif groups

Sign in / Sign up

Export Citation Format

Share Document