Single Machine Schedule Problem with a Fixed Unavailability Interval and Rejection

DOI

10.2991/icmmcce-15.2015.455How to use a DOI?

Keywords

Scheduling, Unavailability interval, Rejection, Heuristic.

Abstract

We investigate a single machine scheduling problem with a fixed unavailability interval on machine and rejection job. The objective is to minimize the sum of the flow-time of the accepted jobs and penalties of rejected jobs. For the demonstrated NP-hard problem, we first propose a dynamic programming algorithm for solving small scale problem optimally. Further we propose an approximation algorithm to obtain a better worst case bound.

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  - Xie Xie
AU  - Xiangyu Kong
AU  - Yongyue Zheng
PY  - 2015/12
DA  - 2015/12
TI  - Single Machine Schedule Problem with a Fixed Unavailability Interval and Rejection
BT  - Proceedings of the 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering 2015
PB  - Atlantis Press
SP  - 1048
EP  - 1051
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmcce-15.2015.455
DO  - 10.2991/icmmcce-15.2015.455
ID  - Xie2015/12
ER  -