Name
Abstract | ||
|---|---|---|
In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. © 2011 Operational Research Society Ltd. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1057/jors.2010.143 | JORS |
Keywords | Field | DocType |
maintenance activity,parallel identical machines,polynomial algorithm,scheduling | Minimization problem,Scheduling (computing),Computer science,Purchasing,Polynomial algorithm,Time complexity,Operations management,Project management | Journal |
Volume | Issue | ISSN |
62 | 10 | 14769360 |
Citations | PageRank | References |
22 | 0.78 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian-Jun Wang | 1 | 84 | 5.21 |
| Jibo Wang | 2 | 745 | 41.50 |
| F. Liu | 3 | 22 | 0.78 |