Minimax resource requirements in cyclic scheduling

Minimax resource requirements in cyclic scheduling

0.00 Avg rating0 Votes
Article ID: iaor19952066
Country: Germany
Volume: 16
Issue: 3
Start Page Number: 203
End Page Number: 210
Publication Date: Apr 1994
Journal: OR Spektrum
Authors: ,
Abstract:

The authors consider a problem concerning periodic activities with identical period lengths. The maximum amount of resource required by such activities is to be minimized. NP-completeness of this problem is demonstrated. In a very important theoretical case-monotonous amount of resource-a linear time algorithm for calculating an exact optimal solution in analytical form is proposed.

Reviews

Required fields are marked *. Your email address will not be published.