Scheduling Deteriorating Jobs and Module Changes with Incompatible Job Families on Parallel Machines Using a Hybrid SADE-AFSA Algorithm

• Published in: Learning and Intelligent Optimization Vol. 11353; pp. 455 - 472
• Main Authors: Sun, Yuwei, Qian, Xiaofei, Liu, Siwen
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2019; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Deteriorating jobs; Incompatible job family; Module change; SADE-AFSA; Scheduling
• ISBN: 3030053474; 9783030053475
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-05348-2_40

This research is motivated by a scheduling problem found in the special steel industry of continuous casting processing, where the special steel is produced on the parallel machines, i.e., the continuous casting machine, and each machine can produce more than one types of special steel. Usually, different types of special steel have diversity alloy content, which generates distinct cooling requirements. Consequently, the job families are incompatible, different types of special steel cannot be continuous process. This indicates that the machine will pause for a period of time to execute the module change activity between two adjacent job families. In this context, we attempt to investigate a parallel machine scheduling problem with the objective of minimizing the makespan, i.e., the completion time of the last job. The effect of deterioration, incompatible job families, and the module change activity are taken into consideration simultaneously, and the actual processing time of each job depends on its starting time and normal processing time. A hybrid SADE-AFSA algorithm combining Self-Adaptive Differential Evolution (SADE) and Artificial fish swarm algorithm (AFSA) is proposed to tackle this problem. Finally, the computational experiments are conducted to evaluate the performance of the proposed algorithm.