Minimizing total completion time on a single machine with a flexible maintenance activity

Authors:
Shan-lin Yang;Ying Ma;Dong-ling Xu;Jian-bo Yang
Affiliations:
School of Management, Hefei University of Technology, 193 Tunxi Road, Hefei 230009, Anhui, China and Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, ...;School of Management, Hefei University of Technology, 193 Tunxi Road, Hefei 230009, Anhui, China and Manchester Business School, The University of Manchester, Manchester M15 6PB, UK;School of Management, Hefei University of Technology, 193 Tunxi Road, Hefei 230009, Anhui, China and Manchester Business School, The University of Manchester, Manchester M15 6PB, UK;School of Management, Hefei University of Technology, 193 Tunxi Road, Hefei 230009, Anhui, China and Manchester Business School, The University of Manchester, Manchester M15 6PB, UK
Venue:
Computers and Operations Research
Year:
2011

Citing 16
Cited 1

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
Improved algorithms for two single machine scheduling problems

Theoretical Computer Science - Algorithmic applications in management
Note: A note on worst-case performance of heuristics for maintenance scheduling problems

Discrete Applied Mathematics
Considering scheduling and preventive maintenance in the flowshop sequencing problem

Computers and Operations Research
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Computers and Operations Research
A two-machine flowshop scheduling problem with a separated maintenance constraint

Computers and Operations Research
Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan

Computers and Operations Research
Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

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

Computers and Industrial Engineering
Scheduling a maintenance activity to minimize total weighted completion-time

Computers & Mathematics with Applications
A note: Simple heuristics for scheduling a maintenance activity on unrelated machines

Computers and Operations Research
Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine

Computers in Industry - Special issue: Application of genetics algorithms in industry
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Scheduling jobs under increasing linear machine maintenance time

Journal of Scheduling

Integrated production scheduling and maintenance policy for robustness in a single machine

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

A problem of jointly scheduling multiple jobs and a single maintenance activity on a single machine with the objective of minimizing total completion time is considered in this paper. It is assumed that the machine should be stopped for maintenance which takes a constant duration within a predefined period. The problem is generalized from the one with a fixed maintenance in that it relaxes the starting time of the maintenance from a fixed time point to a predefined period. Both resumable and nonresumable cases are studied. First, three properties of an optimal solution to each of the two cases are identified. Then it is shown that the proposed shortest processing time (SPT) algorithm is optimal for the resumable case. As for the nonresumable case, the conditions under which the SPT algorithm is optimal are also specified. Furthermore, it is shown that relaxing the starting time of the maintenance cannot improve the relative error bound of the SPT algorithm. The focus of the paper is presented afterwards, which is to develop a dynamic programming algorithm and a branch-and-bound algorithm to generate an optimal solution for this case. Experimental results show that these algorithms are effective and complementary in dealing with different instances of the problem. Statement of scope and purpose: In the majority of scheduling problems with preventive maintenance, maintenance periods are assumed to be constant. However, in real industry settings, such periods may be flexible. Therefore, it is necessary to consider scheduling problems with flexible maintenance. This paper focuses on a single machine problem in which job processing and machine maintenance have to be scheduled simultaneously. The objective is to minimize total completion time of jobs for both resumable and nonresumable cases. For the resumable case, a SPT algorithm proposed in this paper is shown to be optimal. On the other hand, for the nonresumable case, the relative worst-case error bound of the SPT algorithm is analyzed, and further, a dynamic programming algorithm and a branch-and-bound algorithm are proposed to solve this problem optimally. Finally, experimental results are provided to show the effectiveness and complementarity of the above algorithms.