Minimum Total Processing Time Analysis for Moore-Algorithm

DOI

10.2991/itms-15.2015.170How to use a DOI?

Keywords

Production scheduling; single machine deterministic sequencing; algorithm; real-time system

Abstract

Moore (1968) gives an time algorithm to nd an optimal schedule for the single-machine number of late jobs problem. Pinedo (2002) points out, without giving a detail proof, that the early job set generated by the Moore-Algorithm obtains not only the maximum number of jobs but also the smallest total processing time among all optimal schedules. In this paper, we give a new optimality proof of the Moore-Algorithm and show simultaneously that the statement of Pinedo is correct. This property may be applied to study of the hard real-time systems.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Wei Cai
AU  - Shanlin Li
PY  - 2015/11
DA  - 2015/11
TI  - Minimum Total Processing Time Analysis for Moore-Algorithm
BT  - Proceedings of the 2015 International Conference on Industrial Technology and Management Science
PB  - Atlantis Press
SP  - 720
EP  - 723
SN  - 2352-538X
UR  - https://doi.org/10.2991/itms-15.2015.170
DO  - 10.2991/itms-15.2015.170
ID  - Cai2015/11
ER  -