Single machine total completion time scheduling problem with workload-dependent maintenance duration

A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to minimize total completion time. For the case where the derivation of the maintenance duration function is greater than or equal to 1, a polynomial time optimal algorithm is proposed. For the case where the derivation of the maintenance duration function is less than 1, a polynomial time approximation scheme is proposed.

MoreLess

Year of publication:	2015
Authors:	Xu, Dehua ; Wan, Long ; Liu, Aihua ; Yang, Dar-Li
Published in:	Omega. - Elsevier, ISSN 0305-0483. - Vol. 52.2015, C, p. 101-106
Publisher:	Elsevier
Subject:	Scheduling \| Maintenance \| Workload \| Approximation algorithm

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011190632