An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times

Entropy

Rui Zhang¹ 

[1] School of Economics and Management, Nanchang University, Nanchang 330031, China

关键词: shop scheduling;    artificial bee colony algorithm;    maximum lateness;    simulation;   

DOI  :  10.3390/e13091708

来源: mdpi

【 摘 要 】

Due to the influence of unpredictable random events, the processing time of each operation should be treated as random variables if we aim at a robust production schedule. However, compared with the extensive research on the deterministic model, the stochastic job shop scheduling problem (SJSSP) has not received sufficient attention. In this paper, we propose an artificial bee colony (ABC) algorithm for SJSSP with the objective of minimizing the maximum lateness (which is an index of service quality). First, we propose a performance estimate for preliminary screening of the candidate solutions. Then, the K-armed bandit model is utilized for reducing the computational burden in the exact evaluation (through Monte Carlo simulation) process. Finally, the computational results on different-scale test problems validate the effectiveness and efficiency of the proposed approach.

【 授权许可】

CC BY   
© 2011 by the authors; licensee MDPI, Basel, Switzerland.