Rescheduling strategies for minimizing total weighted tardiness in complex job shops

Mason, Scott J.; Jin, Song; Wessels, C. M.

doi:10.1081/00207540310001614132

Cited by 63 publications

(30 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Bollapragada and Sadeh (2004) conducted a comparative study and concluded that for machine breakdowns, their repair approach produce high-quality solutions (regarding the optimized objective) in a fraction of the time required to generate brand new schedules. Mason et al (2004) concluded that total rescheduling provides schedules with less total weighted tardiness than other repair approaches when machine breakdowns occur, but on the expense of larger solution time.…”

Section: Related Workmentioning

confidence: 97%

Analysis of reactive deadlock-free scheduling in flexible job shops

Fahmy

ElMekkawy

Balakrishnan

2007

Int J Flex Manuf Syst

View full text Add to dashboard Cite

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). Using experimental design and analysis of variance (ANOVA), the relative performance of the two approaches is studied and analyzed to provide some measures and guidelines for selecting the appropriate reactive scheduling approach for different problem settings. Three measures of performance are considered in the analysis; efficiency of the revised schedules in terms of the mean flow time, resulting system nervousness, and the required solution time. The results show that, on average, job insertion obtains revised schedules featuring significantly lower system nervousness and slightly higher mean flow time than total rescheduling. However, depending on the system size, number and processing times of the new

show abstract

Section: Related Workmentioning

confidence: 97%

Analysis of reactive deadlock-free scheduling in flexible job shops

Fahmy

ElMekkawy

Balakrishnan

2007

Int J Flex Manuf Syst

View full text Add to dashboard Cite

show abstract

“…Some preliminary steps concerning rescheduling are discussed for example by Mason, Jin, and Wessels (2004) for the shifting bottleneck heuristic in a static environment. However, computational experiments in a dynamic environment are necessary that can be performed with the suggested architecture.…”

Section: Conclusion and Future Researchmentioning

confidence: 99%

Simulation-based benchmarking of production control schemes for complex manufacturing systems

Mönch

2007

Control Engineering Practice

View full text Add to dashboard Cite

“…Real world production shops, however, are unpredictable and dynamic: machines breakdown [2][3][4], workers get sick [5], operations take more or less time than P. Moratori ( ) · S. Petrovic · J.A. Vázquez-Rodríguez School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, UK e-mail: pbm@cs.nott.ac.uk planned [6], suppliers fail to deliver on time [7,8], new production orders arrive to the shop floor [9][10][11], clients cancel orders [12,13], etc.…”

Section: Introductionmentioning

confidence: 99%

Integrating rush orders into existent schedules for a complex job shop problem

2010

View full text Add to dashboard Cite

This paper investigates the problem of inserting new rush orders into a current schedule of a real world job shop floor. Effective rescheduling methods must achieve reasonable levels of performance, measured according to a certain cost function, while preserving the stability of the shop floor, i.e. introducing as few changes as possible to the current schedule. This paper proposes new and effective match-up strategies which modify only a part of the schedule in order to accommodate the arriving jobs. The proposed strategies are compared with other rescheduling methods such as "right shift" and "insertion in the end", which are optimal with respect to stability but poor with respect to performance, and with "total rescheduling" which is optimal with respect to performance but poor with respect to stability. Our results and statistical analysis reveal that the match-up strategies are comparable to the "right shift" and "insertion in the end" with respect to stability and as good as "total rescheduling" with respect to performance.

show abstract

Rescheduling strategies for minimizing total weighted tardiness in complex job shops

Cited by 63 publications

References 15 publications

Analysis of reactive deadlock-free scheduling in flexible job shops

Analysis of reactive deadlock-free scheduling in flexible job shops

Simulation-based benchmarking of production control schemes for complex manufacturing systems

Integrating rush orders into existent schedules for a complex job shop problem

Contact Info

Product

Resources

About