—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
The routing and scheduling of vehicles and their crews is an area of increasing importance. In this paper, we describe a large scale vehicle scheduling and routing problem which i...
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...