Rescheduling With Release Dates to Minimize Total Sequence Disruption Under a Limit on the Makespan

Yuan, Jinjiang; Mu, Yundong; Lu, Lingfa; Li, Wenhua

doi:10.1142/s021759590700153x

Cited by 16 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, when the sequence is disrupted, the initial jobs completion times may change and will be replaced by real completion times obtained after the rescheduling. Moreover, there are also several works dealing with the stability measure in the rescheduling problems, such as the starting time deviation and the total deviation penalty [42], the starting time deviation [45], the amount of operations and the starting times operations have been altered [46], the absolute positional disruption, the positional disruption and the absolute completion time disruption [47], the total sequence disruption [48], the maximum time disruption (change of delivery times of jobs to customers) [49] and the rescheduling cost [50]. Most of these works consider the starting or the completion time deviation as a criterion to evaluate the schedule instability.…”

Section: Literature Reviewmentioning

confidence: 99%

“…During rescheduling event, this measure evaluates the impact of the movement of the jobs [42]. In real life applications, the changes of the sequence may generate supplementary costs, such as raw materials reordering costs and reallocation costs [43][44][45][46][47][48][49][50]. In this work, a new stability criterion is studied, it consists in measuring the difference between the sum of completion times of the jobs in the initial schedule and in the new one, assigning to each job a weight, referred to as the total weighted completion time deviation (TWCTD).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

2021

View full text Add to dashboard Cite

Thanks to smart technological tools, customers can at any moment create or modify their commands. This reality forced many production firms to become sensitive in rescheduling processes. In the literature, most of rescheduling problems consider classical efficiency measures. However, some existing works also consider stability as a measure for limiting the deviation from initial schedule. In this work, we aim to bridge the gap in existing works on rescheduling by investigating a new approach to measure simultaneously efficiency by the total weighted waiting times and stability by the total weighted completion time deviation. This combination of criteria is very significant in industrial and hospital environments. In this paper, a single machine rescheduling problem with jobs arriving over time is considered. A mixed integer linear programming (MILP) model is designed for this problem and an iterative predictive-reactive strategy for dealing with the online part. Numerical results show that, at each time the jobs are rescheduled, the low weight ones move forward. Consequently, a new concept consisting in increasing the jobs weight as function of time is established. The effect of this new conception is evaluated by the evolution of the maximum flowtime. Eventually, the computing time of the MILP resolution is studied to explore its limitations.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

2021

View full text Add to dashboard Cite

show abstract

Rescheduling with new orders and general maximum allowable time disruptions

Zhao

Yuan

2016

4OR-Q J Oper Res

View full text Add to dashboard Cite

Single machine interfering jobs problem with flowtime objective

González

2015

J Intell Manuf

View full text Add to dashboard Cite

)>IJH=?J Interfering jobs problems (or multi agents scheduling problems) are an emergent topic in the scheduling literature. In these decision problems, two or more sets of jobs have to be scheduled, each one with its own criteria. More speci cally, we focus on a problem in which jobs belonging to two sets have to be scheduled in a single machine in order to minimize the total owtime of the jobs in one set, while the total owtime of the jobs in the other set should not exceed a given constant ϵ. This problem is known to be weakly NP-hard, and a Dynamic Programming (DP) algorithm has been proposed to nd optimal solutions.In this paper, we rst analyse the distribution of solutions of the problem in order to establish its empirical hardness. Next, a novel encoding scheme and a set of properties associated to the neighbourhood of this scheme are presented. These properties are used to develop both exact and approximate methods, i.e. a branch and bound (B&B) method, several constructive heuristics, and di erent versions of a genetic algorithm (GA). The computational experience carried out shows that the proposed B&B is more e cient than the existing DP algorithm. The results also show the advantages of the proposed encoding scheme, as the approximate methods yield close-to-optimum solutions for big-sized instances where exact methods are not feasible.Scheduling interfering jobs two-agent scheduling problem total owtime single machine

show abstract

Rescheduling With Release Dates to Minimize Total Sequence Disruption Under a Limit on the Makespan

Cited by 16 publications

References 5 publications

Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

Rescheduling with new orders and general maximum allowable time disruptions

Single machine interfering jobs problem with flowtime objective

Contact Info

Product

Resources

About