Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
The complexity of scheduling independent two-processor tasks on dedicated processors
Information Processing Letters
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
SIAM Journal on Computing
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Simulation and or (operations research) in combination for practical optimization
WSC '05 Proceedings of the 37th conference on Winter simulation
Time-constrained project scheduling with adjacent resources
Computers and Operations Research
Resource allocation with time intervals
Theoretical Computer Science
Scheduling and packing malleable tasks with precedence constraints of bounded width
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Dynamic allocation of check-in facilities and dynamic assignment of passengers at air terminals
Computers and Industrial Engineering
Production scheduling of assembly fixtures in the aeronautical industry
Computers and Industrial Engineering
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
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 n(f) of adjacent desks is to be assigned exclusively during a fixed time-interval I(f) to flight f. For each flight in a given planning horizon of discrete time periods, one seeks a feasible assignment to adjacent desks and the objective is to minimize the total number of involved desks.The paper explores two problem variants and relates them to other scheduling problems. The basic, rectangular version of ARS is a special case of multiprocessor scheduling. The other problem is more general and it does not fit into any existing scheduling model.After presenting an integer linear program for ARS, we discuss the complexity of both problems, as well as of special cases. The decision version of the rectangular problem remains strongly NP-complete. The complexity of the other problem is already strongly NP-complete for two time periods. The paper also determines a number of cases that are solvable in polynomial time.