Paper Info
Title
A multiperiod single processor scheduling problem with periodic requirements
Abstract
A single processor must perform a set of jobs on a planning time horizon subdivided into an infinite number of discrete time instants. At each instant of the discrete planning time horizon, each job will require from the processor a quantity of the processing resource represented by one of the translations of a non-negative discrete time periodic function. The objective is the determination of the phases of these periodic functions so that the maximum of the sum of such functions is minimized over the time.
Year
DOI
Venue
2006
10.1016/j.ejor.2004.09.046
European Journal of Operational Research
Keywords
Field
DocType
Scheduling,Combinatorial optimization,Heuristic algorithm
Periodic function,Mathematical optimization,Time horizon,Heuristic (computer science),Algorithm,Combinatorial optimization,Greedy algorithm,Integer programming,Discrete time and continuous time,Periodic graph (geometry),Mathematics
Journal
Volume
Issue
ISSN
172
1
0377-2217
Citations 
PageRank 
References 
0
0.34
3
Authors
1
Name
Order
Citations
PageRank
Giuseppe Paletta122416.20