Algorithm for Multislot Just-in-Time Scheduling on Identical Parallel Machines

Authors:
Kunihiko Hiraishi
Affiliations:
-
Venue:
ICICIC '07 Proceedings of the Second International Conference on Innovative Computing, Informatio and Control
Year:
2007

Citing 0
Cited 2

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

Journal of Scheduling
Routing equal-size messages on a slotted ring

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multislot just-in time scheduling deals with processing a set of jobs in an environment with cyclically repeating due dates. Every job must be completed exactly at one of its due dates (just-in-time), and the objective is to minimize the number of cyclical periods (slots) in which all jobs can be scheduled, so that no two jobs scheduled on the same ma- chine overlap in time. In this paper we consider several cases of the problem on identical parallel machines, and discuss their complexity.