DocumentCode :
2734926
Title :
Algorithm for Multislot Just-in-Time Scheduling on Identical Parallel Machines
Author :
Shao Chin Sung ; Cepek, O. ; Hiraishi, Kunihiko
Author_Institution :
Aoyama Gakuin Univ., Sagamihara
fYear :
2007
fDate :
5-7 Sept. 2007
Firstpage :
120
Lastpage :
120
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 machine overlap in time. In this paper we consider several cases of the problem on identical parallel machines, and discuss their complexity.
Keywords :
just-in-time; scheduling; identical parallel machines; multislot just-in-time scheduling; Cities and towns; Computer aided instruction; Concurrent computing; Job production systems; Job shop scheduling; Manufacturing; Parallel machines; Processor scheduling; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Computing, Information and Control, 2007. ICICIC '07. Second International Conference on
Conference_Location :
Kumamoto
Print_ISBN :
0-7695-2882-1
Type :
conf
DOI :
10.1109/ICICIC.2007.123
Filename :
4427765
Link To Document :
بازگشت