Scheduling a maintenance activity to minimize total weighted completion-time

Mosheiov, Gur; Sarig, Assaf

doi:10.1016/j.camwa.2008.11.008

Cited by 52 publications

(23 citation statements)

References 9 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraints (7) and (8) represent that the finish time of J [i] equals to the elapsed time of J [i] and all the times of batches before J [i] , including the real batches and empty batches. Constraint (9) ensures that no empty batch exists between J [i-1] and J [i] , when J [i-1] is not the last job in one real batch. Constraint (10) ensures the job's elapsed time is larger than its processing time.…”

Section: A the Problem Formulationmentioning

confidence: 99%

“…Some researchers assume the machine must be maintained after it continuously works for a maximum allowed continuous working time T, and the others assume that the maintenances must be executed in predefined windows [u, v]. The related studies can be found in [8][9][10], et al All the above papers assume that the jobs arrive at time zero. However, it is very common that the jobs arrive at different times in the practical industrial environments.…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Integrated production scheduling and periodic maintenances on a single machine with release dates

Cui

Liu

2014

2014 IEEE International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

This paper addresses the production scheduling problem on a single machine with periodic maintenances, where the jobs' release dates are considered. For the resumable case, we prove that the problem can be solved in polynomial time. For the non-resumable case, we prove that the problem is strongly NP-Hard and propose an effective heuristic ERD-LPT based on the properties of optimal solutions. Then a branch-and-bound algorithm (B&B) that utilizes several dominance rules is developed to search the optimal schedules for the small-to-medium sized problems. Computational results indicate that the proposed heuristic is highly accurate compared with B&B and the improvement of performance is significant compared with the First-in-First-out (FIFO) rule.

show abstract

Section: A the Problem Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Integrated production scheduling and periodic maintenances on a single machine with release dates

Cui

Liu

2014

2014 IEEE International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

show abstract

“…The authors derived the lower and upper bounds to the single-and parallel-machine scenarios. Mosheiov and Sarig [32] studied the scheduling problem of minimizing total weighted completion time on a single machine, where the maintenance activity has to be completed prior to a given deadline. They proposed a pseudo-polynomial dynamic programming algorithm to obtain the optimal solution.…”

Section: Introductionmentioning

confidence: 99%

Minimizing the sum of absolute deviations under a common due date for a single-machine scheduling problem with availability constraints

Low

et al. 2015

Journal of Industrial and Production Engineering

View full text Add to dashboard Cite

This paper investigates a single-machine scheduling problem with a planned maintenance period. The objective is to minimize the sum of absolute deviations (SAD) of job completion times under a common due date. It appears to be the first attempt to schedule jointly the SAD criterion and machine availability constraints. The problem is first mathematically formulated as a mixed integer linear programming model and is then solved optimally. Subsequently, we present some optimality conditions and describe the special cases of the problem which are polynomially solvable. As the computational complexity associated with the formulation makes it difficult for standard solvers address large-sized problems in reasonable solution time, we propose an ant colony optimization algorithm based on the results of our analysis. Computational results for different problem sizes demonstrate that our application of the suggested algorithm is efficient in obtaining near-optimal solutions.

show abstract

“…A recent study of Mosheiov and Sarig [13] was devoted to the problem of scheduling a maintenance activity in a single machine with the objective of minimizing the total weighted completion time.…”

Section: Introductionmentioning

confidence: 99%

A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times

Alvarez¹,

Pacheco²,

Martínez³

2011

Computers & Mathematics with Applications

View full text Add to dashboard Cite

a b s t r a c tIn this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent setup times. To the authors' knowledge, this problem has not been treated as such in the operations research literature. Computational experiments show that it is very hard to solve the problem by exact methods. Therefore, the contribution of this paper is to design and implement a solution approach based on metaheuristic procedures. The proposed method finds high quality solutions in very short computational times.

show abstract

Scheduling a maintenance activity to minimize total weighted completion-time

Cited by 52 publications

References 9 publications

Integrated production scheduling and periodic maintenances on a single machine with release dates

Integrated production scheduling and periodic maintenances on a single machine with release dates

Minimizing the sum of absolute deviations under a common due date for a single-machine scheduling problem with availability constraints

A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times

Contact Info

Product

Resources

About