Maximizing the Total Weight of Just-In-Time Jobs under Multi-Slot Conditions Is NP-Hard

Maximizing the Total Weight of Just-In-Time Jobs under Multi-Slot Conditions Is NP-Hard

A job is called just-in-time if it is completed exactly on its due date. Under multi-slot conditions, each job has one due date per time slot and has to be completed just-in-time on one of its due dates. Moreover, each job has a certain weight per time slot. We would like to find a just-in-time sche...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Information and Systems 2016/02/01, Vol.E99.D(2), pp.525-528
Hauptverfasser: CHIBA, Eishi, IMAHORI, Shinji
Format: Artikel
Sprache:eng
Schlagworte:
Due dates
just-in-time
NP-hard
Schedules
scheduling
time slot
weight
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A job is called just-in-time if it is completed exactly on its due date. Under multi-slot conditions, each job has one due date per time slot and has to be completed just-in-time on one of its due dates. Moreover, each job has a certain weight per time slot. We would like to find a just-in-time schedule that maximizes the total weight under multi-slot conditions. In this paper, we prove that this problem is NP-hard.
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.2015EDL8171