Scheduling

To take full advantage of high performance computing, parallel applications must be carefully managed to guarantee quality of service and fairness in using shared resources. Scheduling for parallel computing is an interdisciplinary subject joining many fields, and the broadness of research yields an immense number and diversity of models for understanding scheduling problems.

This book presents some new applications and trends related to task and data scheduling. This book presents novel algorithms and literature reviews that will guide current and new researchers who work with load balancing, scheduling, and allocation problems.

This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics.

This book investigates in detail production scheduling technology in different kinds of shop environment to achieve sustainability manufacturing. Studies on shop scheduling have attracted engineers and scientists from various disciplines, such as electrical, mechanical, automation, computer, and industrial engineering. Pursuing a holistic approach, the book establishes a fundamental framework for this topic, while emphasizing the importance of intelligent optimization and the significant influence of production scheduling in the manufacturing systems. The book is intended for undergraduate and graduate students who are interested in intelligent optimization technology, shop scheduling, and green manufacturing systems or other scheduling applications.

This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.