Open AccessThis article is
- freely available
An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times
School of Economics and Management, Nanchang University, Nanchang 330031, China
Department of Automation, Tsinghua University, Beijing 100084, China
* Author to whom correspondence should be addressed.
Received: 13 July 2011; in revised form: 9 September 2011 / Accepted: 9 September 2011 / Published: 19 September 2011
Abstract: 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.
Keywords: shop scheduling; artificial bee colony algorithm; maximum lateness; simulation
Citations to this Article
Cite This Article
MDPI and ACS Style
Zhang, R.; Wu, C. An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times. Entropy 2011, 13, 1708-1729.
Zhang R, Wu C. An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times. Entropy. 2011; 13(9):1708-1729.
Zhang, Rui; Wu, Cheng. 2011. "An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times." Entropy 13, no. 9: 1708-1729.