Evolutionary algorithm for stochastic job shop scheduling with random processing time

Authors:
Shih-Cheng Horng;Shieh-Shing Lin;Feng-Yi Yang
Affiliations:
Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taiwan, ROC;Department of Electrical Engineering, St. John's University, Taiwan, ROC;Department of Biomedical Imaging and Radiological Sciences, National Yang-Ming University, Taiwan, ROC
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 9
Cited 1

Evolution strategies –A comprehensive introduction

Natural Computing: an international journal
An ordinal optimization theory-based algorithm for a class of simulation optimization problems and application

Expert Systems with Applications: An International Journal
Ordinal Optimization and Quantification of Heuristic Designs

Discrete Event Dynamic Systems
A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem

Computers and Operations Research
A hybrid approach to large-scale job shop scheduling

Applied Intelligence
A simulation-optimization approach for integrated sourcing and inventory decisions

Computers and Operations Research
Computational Intelligence in Flow Shop and Job Shop Scheduling

Computational Intelligence in Flow Shop and Job Shop Scheduling
Job shop scheduling by pheromone approach in a dynamic environment

International Journal of Computer Integrated Manufacturing
Ordinal Optimization: Soft Optimization for Hard Problems

Ordinal Optimization: Soft Optimization for Hard Problems

Fast reactive scheduling to minimize tardiness penalty and energy cost under power consumption uncertainties

Computers and Industrial Engineering

Quantified Score

Hi-index	12.05

Visualization

Abstract

In this paper, an evolutionary algorithm of embedding evolutionary strategy (ES) in ordinal optimization (OO), abbreviated as ESOO, is proposed to solve for a good enough schedule of stochastic job shop scheduling problem (SJSSP) with the objective of minimizing the expected sum of storage expenses and tardiness penalties using limited computation time. First, a rough model using stochastic simulation with short simulation length will be used as a fitness approximation in ES to select N roughly good schedules from search space. Next, starting from the selected N roughly good schedules we proceed with goal softening procedure to search for a good enough schedule. Finally, the proposed ESOO algorithm is applied to a SJSSP comprising 8 jobs on 8 machines with random processing time in truncated normal, uniform, and exponential distributions. The simulation test results obtained by the proposed approach were compared with five typical dispatching rules, and the results demonstrated that the obtaining good enough schedule is successful in the aspects of solution quality and computational efficiency.