Generating robust and flexible job shop schedules using genetic algorithms

Authors:
M. T. Jensen
Affiliations:
Dept. of Comput. Sci., Univ. of Aarhus, Denmark
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2003

Citing 0
Cited 22

Neighbourhood Based Robustness Applied to Tardiness and Total Flowtime Job Shops

PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Heuristic stability: A permutation disarray measure

Computers and Operations Research
A study of the contribution made by evolutionary learning on dynamic load-balancing problems in distributed computing systems

Expert Systems with Applications: An International Journal
Economic design of variable sampling intervals EWMA charts with sampling at fixed times using genetic algorithms

Expert Systems with Applications: An International Journal
Application areas of AIS: The past, the present and the future

Applied Soft Computing
Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms

Applied Soft Computing
Economic statistical design of non-uniform sampling scheme X bar control charts under non-normality and Gamma shock using genetic algorithm

Expert Systems with Applications: An International Journal
A robust scheduling method based on a multi-objective immune algorithm

Information Sciences: an International Journal
Economic design of variable sampling intervals T2 control charts using genetic algorithms

Expert Systems with Applications: An International Journal
Optimization of phase angle measurement unit placement

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Robust model for job shop scheduling with uncertain processing times

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Analysis of robustness in proactive scheduling: A graphical approach

Computers and Industrial Engineering
Integrating rush orders into existent schedules for a complex job shop problem

Applied Intelligence
Minimizing the cost of integrated systems approach to process control and maintenance model by EWMA control chart using genetic algorithm

Expert Systems with Applications: An International Journal
Business process scheduling with resource availability constraints

OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
GA optimization of Petri net-modeled concurrent service systems

Applied Soft Computing
Rescheduling of flexible job shops under machine breakdowns

ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Genetic algorithms for match-up rescheduling of the flexible manufacturing systems

Computers and Industrial Engineering
A genetic algorithm of high-throughput and low-jitter scheduling for input-queued switches

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
On the origin of the evolutionary computation species influences of Darwin's theories on computer science

Artificial Intelligence Review
An artificial immune system for solving production scheduling problems: a review

Artificial Intelligence Review
A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of finding robust or flexible solutions for scheduling problems is of utmost importance for real-world applications as they operate in dynamic environments. In such environments, it is often necessary to reschedule an existing plan due to failures (e.g., machine breakdowns, sickness of employees, deliveries getting delayed, etc.). Thus, a robust or flexible solution may be more valuable than an optimal solution that does not allow easy modifications. This paper considers the issue of robust and flexible solutions for job shop scheduling problems. A robustness measure is defined and its properties are investigated. Through experiments, it is shown that using a genetic algorithm it is possible to find robust and flexible schedules with a low makespan. These schedules are demonstrated to perform significantly better in rescheduling after a breakdown than ordinary schedules. The rescheduling performance of the schedules generated by minimizing the robustness measure is compared with the performance of another robust scheduling method taken from literature, and found to outperform this method in many cases.