Many decisions in operations management (OM) belong to the class of Non-deterministic
Polynomial hard problems and thus heuristic search methods have been applied to improve …

Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …

The first part of this chapter describes the foundation of genetic algorithms. It includes hybrid
genetic algorithms, adaptive genetic algorithms, and fuzzy logic controllers. After a short …

A comprehensive guide to a powerful new analytical tool by two of its foremost innovators
The past decade has witnessed many exciting advances in the use of genetic algorithms …

Comparing, or benchmarking, of optimization algorithms is a complicated task that involves
many subtle considerations to yield a fair and unbiased evaluation. In this paper, we …

Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions
proposed are of hybrid construction cutting across the traditional disciplines. The problem …

The job shop scheduling problem (JSSP) with dynamic events and uncertainty is a strongly
NP-hard combinatorial optimization problem (COP) with extensive applications in the …

Cloud computing has become an increasingly important research topic given the strong
evolution and migration of many network services to such computational environment. The …

In this paper, we propose new memetic algorithms (MAs) for the multiobjective flexible job
shop scheduling problem (MO-FJSP) with the objectives to minimize the makespan, total …

This paper proposes an integrated scheduling optimization model based on mixed integer
programming to analytically characterize the U-shaped automated container terminal layout …