Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives

Curry, James; Peters, BA

doi:10.1080/00207540500103953

Cited by 28 publications

(19 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They provide a polynomial-time algorithm that nds a set of ecient schedules with respect to two dierent criteria. Curry and Peters (2005) address the problem of nervousness reduction in parallel machine settings under dynamic job arrivals. Lee et al (2006) address the problem of two machine scheduling under disruptions with transportation costs considerations.…”

Section: Parallel Machine Environmentmentioning

confidence: 99%

Flow shop rescheduling under different types of disruption

Katragjini

Vallada

Ruíz

2013

International Journal of Production Research

112

View full text Add to dashboard Cite

Almost all manufacturing facilities need to use production planning and scheduling systems to increase productivity and to reduce production costs. Real-life production operations are subject to a large number of unexpected disruptions that may invalidate the original schedules. In these cases, rescheduling is essential for minimizing the impact on the performance of the system. In this work we consider owshop layouts that have been seldom studied in the rescheduling literature. We generate and employ three types of disruptions that interrupt the original schedules simultaneously. We develop rescheduling algorithms to nally accomplish the twofold objective of establishing a standard framework on the one hand and of proposing rescheduling methods that seek a good trade-o between schedule quality and stability on the other hand.

show abstract

Section: Parallel Machine Environmentmentioning

confidence: 99%

Flow shop rescheduling under different types of disruption

Katragjini

Vallada

Ruíz

2013

International Journal of Production Research

112

View full text Add to dashboard Cite

show abstract

“…Wu et al (1993), Daniels andKouvelis (1995), Ü nal et al (1997), O'Donovan et al (1999), Hall and Potts (2004) and Qi et al (2006) study rescheduling problems on a single machine. The most noteworthy rescheduling studies in parallel machine environments are due to Church and Uzsoy (1992), Bean et al (1991), Leung and Pinedo (2004), Alago¨z and Azizog˘lu (2003), Azizog˘lu and Alago¨z (2005), Curry and Peters (2005) and Ö zlen and Azizog˘lu (2007). Church and Uzsoy (1992) consider single and parallel machines to minimise the maximum lateness and the number of times rescheduling is done.…”

Section: Introductionmentioning

confidence: 99%

“…They provide polynomial-time solution methods to the hierarchical optimisation problems of the two measures and propose non-polynomial exact algorithms to generate all efficient solutions and to minimise a specified function of the measures. Curry and Peters (2005) consider the total disruption cost as a stability measure and total tardiness as an efficiency measure. They propose a simulation study to test the performances of some heuristic procedures and rescheduling strategies.…”

Section: Introductionmentioning

confidence: 99%

Generating all efficient solutions of a rescheduling problem on unrelated parallel machines

Özlen

Azizoğlu

2009

International Journal of Production Research

View full text Add to dashboard Cite

In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and stability measures. Our efficiency measure is the total flow time and stability measure is the total reassignment cost caused by the differences in the machine allocations in the initial and new schedules. We propose a branch and bound algorithm to generate all efficient solutions with respect to our efficiency and stability measures. We improve the efficiency of the algorithm by incorporating powerful reduction and bounding mechanisms. Our computational tests on large sized problem instances have revealed the satisfactory behaviour of our algorithm.

show abstract

“…In an earlier project management reference, Birge and Maddox (1995) discuss this type of tardy cost. Curry and Peters (2005) pointed out that the stepwise tardiness happens in many modes of transportation, such as less than truckload, expedited ground, and airfreight forwarding. They applied a simulation approach for the parallel machine rescheduling problem with the stepwise tardiness and machine assignment stability criteria.…”

Section: Introductionmentioning

confidence: 99%

A Variable Neighborhood Search for the Single Machine Total Stepwise Tardiness Problem

Tseng¹,

Chou²

2010

Proceedings of the 2010 (1st) International Conference on Engineering, Project, and Production Management

View full text Add to dashboard Cite

A new type of tardy cost, called stepwise tardiness, is considered in a single machine problem. The stepwise tardiness scheduling has been found in many practical situations. To the best of our knowledge, there exist few studies directly addressing the problem. In this paper, we develop a heuristic for the single machine total stepwise tardiness (SMTST) problem. In addition, a variable neighborhood search (VNS), which is a novel metaheuristic, is proposed to improve the quality of solution. The proposed VNS algorithm includes a new encoding scheme and three new neighborhood structures. The experimental results show that the proposed VNS algorithm can obtain a good performance for the considered problem.

show abstract

Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives

Cited by 28 publications

References 17 publications

Flow shop rescheduling under different types of disruption

Flow shop rescheduling under different types of disruption

Generating all efficient solutions of a rescheduling problem on unrelated parallel machines

A Variable Neighborhood Search for the Single Machine Total Stepwise Tardiness Problem

Contact Info

Product

Resources

About