Single-Machine Scheduling with Piece-Rate Maintenance, Interval Constrained Processing Times and Rejection Penalties

DOI

10.2991/jimec-18.2018.7How to use a DOI?

Keywords

scheduling; piece-rate maintenance; constrained processing times; rejection penalty

Abstract

This paper investigates single-machine scheduling problems with piece-rate machine maintenance and rejection penalties, where the actual job processing time is required to be in the given time interval otherwise the extra penalty should be paid. Each job should be decided to be scheduled or rejected, and the corresponding penalty should be paid when the job is rejected. This paper aims to find the optimal job sequence, the maintenances frequency and the rejected job set to minimize the sum of both the penalties and the makespan of scheduled jobs, the total number of jobs exceeding the time interval and the total completion time, respectively. Analyzed results show that all the considered problems can be optimally solved in polyno-mial time. Moreover, numeric experiments are conducted to illustrate the efficiency of the proposed algorithm, and to ana-lyze the positive interacting relationship among rejection pun-ishment, the length of time widow and the scheduling results.

Copyright

© 2019, 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  - Lei Jin
AU  - Xianyu Yu
AU  - Zhuojia Dong
PY  - 2018/12
DA  - 2018/12
TI  - Single-Machine Scheduling with Piece-Rate Maintenance, Interval Constrained Processing Times and Rejection Penalties
BT  - Proceedings of the 2018 3rd Joint International Information Technology，Mechanical and Electronic Engineering Conference (JIMEC 2018)
PB  - Atlantis Press
SP  - 32
EP  - 37
SN  - 2589-4943
UR  - https://doi.org/10.2991/jimec-18.2018.7
DO  - 10.2991/jimec-18.2018.7
ID  - Jin2018/12
ER  -