

Publisher: Springer Publishing Company
ISSN: 1094-6136
Source: Journal of Scheduling, Vol.9, Iss.1, 2006-02, pp. : 49-62
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We study the problem of scheduling resource(s) for jobs in an adjacent manner (ARS). The problem relates to fixed-interval scheduling on one hand, and to the problem of two-dimensional strip packing on the other. Further, there is a close relation with multiprocessor scheduling. A distinguishing characteristic is the constraint of resource-adjacency.As an application of ARS, we consider an airport where passengers check in for their flight, joining lines before one or more desks, at the desk the luggage is checked and so forth. To smoothen these operations the airport maintains a clear order in the waiting lines: a number
Related content


On resource-bounded instance complexity
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :


Optimum resource determination for project scheduling
Production Planning and Control, Vol. 8, Iss. 5, 1997-07 ,pp. :


Resource bounded randomness and computational complexity
By Wang Y.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :

