An Imperialist Competitive Algorithm for a Real-World Flexible Job Shop Scheduling Problem

Traditional planning and scheduling techniques still hold important roles in modern smart scheduling systems. Realistic features present in modern manufacturing systems need to be incorporated into these techniques. The real-world problem addressed here is an extension of flexible job shop schedulin...

Full description

Saved in:
Bibliographic Details
Main Authors: Tessaro Lunardi, Willian, Voos, Holger, Cherri, Luiz Henrique
Format: Conference Proceeding
Language:English
Subjects:
Electronic mail
Genetic algorithms
Heuristic algorithms
Job shop scheduling
Processor scheduling
Schedules
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Traditional planning and scheduling techniques still hold important roles in modern smart scheduling systems. Realistic features present in modern manufacturing systems need to be incorporated into these techniques. The real-world problem addressed here is an extension of flexible job shop scheduling problem and is issued from the modern printing and boarding industry. The precedence between operations of each job is given by an arbitrary directed acyclic graph rather than a linear order. In this paper, we extend the traditional FJSP solutions representation to address the parallel operations. We propose an imperialist competitive algorithm for the problem. Several instances are used for the experiments and the results show that, for the considered instances, the proposed algorithm is faster and found better or equal solutions compared to the state-of-the-art algorithms.
ISSN:1946-0759
DOI:10.1109/ETFA.2018.8502596