Hits:

Indexed by:期刊论文

Date of Publication:2010-03-01

Journal:INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

Included Journals:SCIE、EI、Scopus

Volume:124

Issue:1

Page Number:151-158

ISSN No.:0925-5273

Key Words:Scheduling; Two parallel machine; Makespan; Total completion time; Multiple maintenance; Bin-packing problem

Abstract:This paper deals with the problem of processing a set of n jobs on two identical parallel machines. In order to reduce the probability of machine breakdown with minor sacrifices in production time, the machines cannot process the jobs consecutively, they need to be maintained regularly (here we assume that the largest consecutive working time for each machine cannot exceed an upper limit T). Two scheduling models are considered. In the first model, the maintenance activities are performed periodically and the objective is to schedule the jobs on two machines such that the makespan is minimized. In the second model, the maintenance activities are determined jointly with the scheduling of jobs, and the objective is to minimize the total completion time of jobs. For the first problem we, introduce an O(n(2)) time algorithm named MH(FFD) and show that the performance ratio of MH(FFD) is at most max{1.6+1.2 sigma,2}, where sigma((Delta) under bar)t/T, t is the amount of time to perform each maintenance activity. For the second problem, we apply the classical SIT algorithm to it and show that the worst-case bound of SPT algorithm is no more than 1 + 2 sigma. We also point out that for the case of single machine, if the SPT schedule has three batches, then the upper bound of SPT algorithm can be reduced from the known result 21/17 to 11/9 under the assumption that t < T. (C) 2009 Elsevier B.V. All rights reserved.