Match-Up Strategies for Job Shop Rescheduling

Authors:
Patrick Moratori;Sanja Petrovic;Antonio Vázquez
Affiliations:
School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK
Venue:
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Year:
2008

Citing 6
Cited 3

OPIS: an opportunistic factory scheduling system

IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Matchup scheduling with multiple resources, release dates and disruptions

Operations Research
One-machine rescheduling heuristics with efficiency and stability as criteria

Computers and Operations Research
Optimal match-up strategies in stochastic scheduling

Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
A dynamic reactive scheduling mechanism for responding to changes of production orders and manufacturing resources

Computers in Industry
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods

Journal of Scheduling

Dynamic scheduling of emergency department resources

Proceedings of the 1st ACM International Health Informatics Symposium
Genetic algorithms for match-up rescheduling of the flexible manufacturing systems

Computers and Industrial Engineering
Dynamic resource scheduling in disruption-prone software development environments

FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of integrating new rush orders into the current schedule of a real world job shop floor. Satisfactory rescheduling methods must keep stability of the shop, by introducing the fewest number of changes in the ordering of operations, while maintaining the same levels of the schedule performance criteria. This paper introduces a number of match-up strategies that modify only part of the schedule in order to accommodate new arriving jobs. These strategies are compared with the right-shift and the total-rescheduling methods, which are optimal regarding stability and performance, but ineffective for performance and stability, respectively. Statistical analysis indicates that the match-up strategies are comparable to right-shift for stability, and as good as total-rescheduling for performance.