Print Email Facebook Twitter Scheduling with release times and deadlines Title Scheduling with release times and deadlines Author Elffers, J.A. Contributor De Weerdt, M.M. (mentor) Witteveen, C. (mentor) Aardal, K.I. (mentor) Faculty Electrical Engineering, Mathematics and Computer Science Department Software and Computer Technology Programme Algorithmics Date 2014-08-28 Abstract We study the single machine version of the task scheduling problem with release times and deadlines. This problem is too simple to be of practical importance in itself, but it is also used as a relaxation in algorithms for the Job Shop scheduling problem, which is a more practical task scheduling problem. We study exact algorithms for solving the single machine problem. We propose a new lower bound for the single machine problem and analyze its practical performance when used in a branch and bound algorithm. We also study the theoretical hardness of the single machine problem with a fixed set of task lengths. Subject schedulingexact algorithmsforbidden regions To reference this document use: http://resolver.tudelft.nl/uuid:5def2dbb-67d1-4672-a0b1-561d7dc1a74f Embargo date 2015-08-28 Part of collection Student theses Document type master thesis Rights (c) 2014 Elffers, J.A. Files PDF thesis.pdf 743.1 KB Close viewer /islandora/object/uuid:5def2dbb-67d1-4672-a0b1-561d7dc1a74f/datastream/OBJ/view