Flexible open shop scheduling problem to minimize makespan

Flexible open shop scheduling problem to minimize makespan

0.00 Avg rating0 Votes
Article ID: iaor201530042
Volume: 67
Issue: 4
Start Page Number: 207
End Page Number: 215
Publication Date: Mar 2016
Journal: Computers and Operations Research
Authors: , ,
Keywords: scheduling, combinatorial optimization
Abstract:

This study investigates the static and dynamic versions of the flexible open shop scheduling problem with the goal of minimizing makespan. The asymptotic optimality of the general dense scheduling (GDS) algorithm is proven by the boundedness hypothesis. For large-scale problems, the GDS-based heuristic algorithms are presented to accelerate convergence. For moderate-scale problems, the differential evolution algorithm is employed to obtain high-quality solutions. A series of random experiments are conducted to demonstrate the effectiveness of the proposed algorithms.

Reviews

Required fields are marked *. Your email address will not be published.