Article ID: | iaor2009991 |
Country: | United States |
Volume: | 19 |
Issue: | 3 |
Start Page Number: | 264 |
End Page Number: | 285 |
Publication Date: | Jan 2007 |
Journal: | International Journal of Flexible Manufacturing Systems |
Authors: | Balakrishnan Subramaniam, ElMekkawy Tarek Y., Fahmy Sherif A. |
Keywords: | job shop |
Reactive scheduling is a procedure followed in production systems to react to unforeseen events that disturb the normal operation of the system. In this paper, a novel operations insertion heuristic is proposed to solve the deadlock-free reactive scheduling problem in flexible job shops, upon the arrival of new jobs. The heuristic utilizes rank matrices (Latin rectangles) to insert new jobs in schedules, while preventing the occurrence of deadlocks or resolving them using the available buffer space (if any). Jobs with alternative processing routes through the system are also considered. The heuristic can be employed to execute two reactive scheduling approaches in a timely efficient manner; to insert the new jobs in the already existing schedule (job insertion) or to reschedule all the jobs in the system (total rescheduling).