Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness

Sbihi, Mohammed; Varnier, Christophe

doi:10.1016/j.cie.2008.03.005

Cited by 88 publications

(43 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Processing times, p, are randomly chosen from a discrete uniform distribution over [1; 10], identically done in some other references, e.g. Sbihi and Varnier [17], Liao and Chen [8], and Pathumnakul and Egbelu [23]. For any problem with n jobs, we run 10 random sampling (replications) for each combination of parameters.…”

Section: Numerical Examples and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Minimizing maximum earliness in single-machine scheduling with flexible maintenance time

2017

View full text Add to dashboard Cite

Abstract. We consider minimizing the maximum earliness in the single-machine scheduling problem with exible maintenance. In this problem, preemptive operations are not allowed, the machine should be shut down to perform maintenance, tool changing or resetting takes a constant time, and the time window inside which maintenance should be performed is prede ned. We show that the problem is NP-hard. Afterward, we propose some dominance properties and an e cient heuristic method to solve the problem. Also, we propose a branch-and-bound algorithm, in which our heuristic method, the lower bound, and the dominance properties are incorporated. The algorithm is computationally examined using 3,840 instances up to 14,000 jobs. The results impressively show that the proposed heuristic algorithm obtains the optimal solution in about 99.5% of the cases using an ordinary processor in a matter of seconds at most.

show abstract

Section: Numerical Examples and Resultsmentioning

confidence: 99%

“…They showed that these problems are NP-hard. Sbihi and Varnier [17] presented a heuristic method for the single-machine scheduling problem with several maintenance periods. Speci cally, two situations were investigated in their study: rst, maintenance periods were periodically xed (i.e.…”

Section: Introductionmentioning

confidence: 99%

Minimizing maximum earliness in single-machine scheduling with flexible maintenance time

2017

View full text Add to dashboard Cite

show abstract

“…As periodic maintenance predetermines a fixed time interval to perform maintenance operations (i.e., characteristics of the unavailability periods is known in advance), machine idleness will appear due to the incoordination of the total processing time of prior batch and the fixed time interval. Hence, though these research have considered periodic maintenance planning into production scheduling model, it seems not economic due to machine idleness [17][18][19]. If maintenance operations could be well planned according to jobs' processing time and machine's condition, much more resources will be saved.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Sbihi and Varnier [18] studied the same problem by using their own proposed model. And the schedule obtained by their model is shown in Fig.…”

Section: Case 2: Production Scheduling Model With Periodic Maintenancmentioning

confidence: 99%

A joint model of production scheduling and predictive maintenance for minimizing job tardiness

Pan

Liao

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

As increasingly diverse tasks are being processed on single multi-functional machine, production scheduling has become a critical issue in the planning and management of manufacturing processes. However, the majority of production scheduling literature ignores machine availability and assumes that machine is available all the time. In reality, machines physically deteriorate with increased usage and time. Thus, there is an intense need for manufacturing industries to reduce unexpected breakdowns and remain competitive, and motivating maintenance operations should be integrated into production scheduling models. With the advancements in sensor and prognostic technologies, machine's condition can be monitored and assessed over time through conducting predictive maintenance. Hence, based on this scheme, this study proposes a single-machinebased scheduling model incorporating production scheduling and predictive maintenance. A machine's effective age and remaining maintenance life are introduced to describe machine degradation. Finally, a numerical example is given; the computational results show that this integrated scheduling model has better performance than those existing models, which proves its efficiency.

show abstract

“…In this problem, machines must be stopped for periodical maintenance (Pinedo, 2002, Chen, 2006. Sbihi and Varnier (2008) considered a single-machine scheduling problem with several maintenances periods under two different scenarios. In the first one, maintenance periods were periodically fixed while in the second one, the maintenance was not fixed but the maximum continuous working time of the machine allowed was determined.…”

Section: Introductionmentioning

confidence: 99%

Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm

Esmaeili¹

2012

MSL

View full text Add to dashboard Cite

This paper deals with a single-machine scheduling problem with maintenance activities. Our purpose is to provide a near optimal solution using metaheuristics approach. In this problem, there are jobs and machines ( > ), each job must be assigned to one and only one machine, where the processing time of job ( ) is ( ). Furthermore there are groups where each group has a fix periodic interval T and for each group, the maximum number of jobs processed in the machines available time interval ( ) is , = . For finding the near optimal solution, we consider optimizing total cost scheduling problem. This problem has two types of costs, group cost and gap cost. In this study, first, proposed problem is formulated in a mathematical model. Next, a heuristic genetic algorithm is used to obtain the proposed problem and on example is presented to verify the efficiency of the algorithm.

show abstract

Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness

Cited by 88 publications

References 16 publications

Minimizing maximum earliness in single-machine scheduling with flexible maintenance time

Minimizing maximum earliness in single-machine scheduling with flexible maintenance time

A joint model of production scheduling and predictive maintenance for minimizing job tardiness

Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm

Contact Info

Product

Resources

About