Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
141,428
result(s) for
"Scheduling"
Sort by:
Integration of process planning and scheduling : approaches and algorithms
\"Both process planning and scheduling are very important functions of manufacturing, which affects together the cost to manufacture a product and the time to deliver it. This book contains various approaches proposed by researchers, to integrate the process planning and scheduling functions of manufacturing under varying configurations of shops. It is useful for both beginners and advanced researchers to understand and formulate the Integration Process Planning and Scheduling (IPPS) problem effectively\"-- Provided by publisher.
BOOK
A survey on the scheduling mechanisms in serverless computing: a taxonomy, challenges, and trends
In recent years, serverless computing has received significant attention due to its innovative approach to cloud computing. In this novel approach, a new payment model is presented, and a microservice architecture is implemented to convert applications into functions. These characteristics make it an appropriate choice for topics related to the Internet of Things (IoT) devices at the network’s edge because they constantly suffer from a lack of resources, and the topic of optimal use of resources is significant for them. Scheduling algorithms are used in serverless computing to allocate resources, which is a mechanism for optimizing resource utilization. This process can be challenging due to a number of factors, including dynamic behavior, heterogeneous resources, workloads that vary in volume, and variations in number of requests. Therefore, these factors have caused the presentation of algorithms with different scheduling approaches in the literature. Despite many related serverless computing studies in the literature, to the best of the author’s knowledge, no systematic, comprehensive, and detailed survey has been published that focuses on scheduling algorithms in serverless computing. In this paper, we propose a survey on scheduling approaches in serverless computing across different computing environments, including cloud computing, edge computing, and fog computing, that are presented in a classical taxonomy. The proposed taxonomy is classified into six main approaches: Energy-aware, Data-aware, Deadline-aware, Package-aware, Resource-aware, and Hybrid. After that, open issues and inadequately investigated or new research challenges are discussed, and the survey is concluded.
Journal Article
Healthcare scheduling in optimization context: a review
This paper offers a summary of the latest studies on healthcare scheduling problems including patients’ admission scheduling problem, nurse scheduling problem, operation room scheduling problem, surgery scheduling problem and other healthcare scheduling problems. The paper provides a comprehensive survey on healthcare scheduling focuses on the recent literature. The development of healthcare scheduling research plays a critical role in optimizing costs and improving the patient flow, providing prompt administration of treatment, and the optimal use of the resources provided and accessible in the hospitals. In the last decades, the healthcare scheduling methods that aim to automate the search for optimal resource management in hospitals by using metaheuristics methods have proliferated. However, the reported results are disintegrated since they solved every specific problem independently, given that there are many versions of problem definition and various data sets available for each of these problems. Therefore, this paper integrates the existing results by performing a comprehensive review and analyzing 190 articles based on four essential components in solving optimization problems: problem definition, formulations, data sets, and methods. This paper summarizes the latest healthcare scheduling problems focusing on patients’ admission scheduling problems, nurse scheduling problems, and operation room scheduling problems considering these are the most common issues found in the literature. Furthermore, this review aims to help researchers to highlight some development from the most recent papers and grasp the new trends for future directions.
Journal Article
A survey of dynamic scheduling in manufacturing systems
In most real-world environments, scheduling is an ongoing reactive process where the presence of a variety of unexpected disruptions is usually inevitable, and continually forces reconsideration and revision of pre-established schedules. Many of the approaches developed to solve the problem of static scheduling are often impractical in real-world environments, and the near-optimal schedules with respect to the estimated data may become obsolete when they are released to the shop floor. This paper outlines the limitations of the static approaches to scheduling in the presence of real-time information and presents a number of issues that have come up in recent years on dynamic scheduling.
The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing research on dynamic scheduling. The principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristics, multi-agent systems, and other artificial intelligence techniques are described in detail, followed by a discussion and comparison of their potential.
Journal Article
Multiagent Scheduling : Models and Algorithms
Scheduling theory has received a growing interest since its origins in the second half of the 20th century. Developed initially for the study of scheduling problems with a single objective, the theory has been recently extended to problems involving multiple criteria. However, this extension has still left a gap between the classical multi-criteria approaches and some real-life problems in which not all jobs contribute to the evaluation of each criterion. In this book, we close this gap by presenting and developing multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. Several scenarios are introduced, depending on the definition and the intersection structure of the job subsets. Complexity results, approximation schemes, heuristics and exact algorithms are discussed for single-machine and parallel-machine scheduling environments. Definitions and algorithms are illustrated with the help of examples and figures.
Book
Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming
Hybrid flow shop scheduling problems are encountered in many real-world manufacturing operations such as computer assembly, TFT-LCD module assembly, and solar cell manufacturing. Most research considers the scheduling problem in regard to time requirements and the steps needed to improve production efficiency. However, the increasing amount of carbon emissions worldwide is contributing to the worsening global warming problem. Many countries and international organizations have started to pay attention to this problem, even creating mechanisms to reduce carbon emissions. Furthermore, manufacturing enterprises are showing growing interest in realizing energy savings. Thus, the present research study focuses on reducing energy costs and completion time at the manufacturing-system level. This paper proposed a multi-objective mixed-integer programming for energy-efficient hybrid flow shop scheduling with lot streaming in order to minimize both the production makespan and electric power consumption. Due to a trade-off between these objectives and the computational complexity of the proposed multi-objective mixed-integer program, this study adopts the genetic algorithm (GA) to obtain approximate Pareto solutions more efficiently. In addition, a multi-objective energy efficiency scheduling algorithm is also developed to calculate the fitness values of each chromosome in GA.
Journal Article
Reinforcement learning applications to machine scheduling problems: a comprehensive literature review
Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature.
Journal Article