Next Article in Journal
Blind Deconvolution of Seismic Data Using f-Divergences
Previous Article in Journal
Tsallis Mutual Information for Document Classification
Article Menu

Export Article

Open AccessArticle
Entropy 2011, 13(9), 1708-1729; doi:10.3390/e13091708

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

1
School of Economics and Management, Nanchang University, Nanchang 330031, China
2
Department of Automation, Tsinghua University, Beijing 100084, China
*
Author to whom correspondence should be addressed.
Received: 13 July 2011 / Revised: 9 September 2011 / Accepted: 9 September 2011 / Published: 19 September 2011
View Full-Text   |   Download PDF [891 KB, uploaded 24 February 2015]   |  

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 shop scheduling; artificial bee colony algorithm; maximum lateness; simulation
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & 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.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top