Citation
Time-hierarchical scheduling A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem. Journal of Scheduling, 19 (3): 215-225, 2016.
Selected
Abstract
In this paper, the general time hierarchical planning and scheduling approach is introduced, which integrates both detailed scheduling and due date assignment for an online problem. In this approach, time is divided into intervals of increasing size, and the different sizes form a hierarchy. We show that for a simplified model, a multiple level bin packing approach is an approximation algorithm, and we further prove that under weak assumptions, the approximation quality is bounded independently of the depth of the hierarchy.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-014-0384-y You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2016-251-225-SI, author = {Leoff, Jens and Ackermann, Heiner and Kuefer, Karl-Heinz},
title = {{Time-hierarchical scheduling A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem}},
journal = {Journal of Scheduling},
year = {2016},
volume = {{19}},
pages = {215--225},
number = {3},
note = {Selected},
abstract = {{In this paper, the general time hierarchical planning and scheduling approach is introduced, which integrates both detailed scheduling and due date assignment for an online problem. In this approach, time is divided into intervals of increasing size, and the different sizes form a hierarchy. We show that for a simplified model, a multiple level bin packing approach is an approximation algorithm, and we further prove that under weak assumptions, the approximation quality is bounded independently of the depth of the hierarchy.}},
doi = {{10.1007/s10951-014-0384-y}},
eissn = {{1099-1425}},
issn = {{1094-6136}},
owner = {Graham},
timestamp = {2017.01.18},
unique-id = {{ISI:000377606100002}} }