Scheduling problems for parallel dedicated machines under multiple resource constraints

Authors:
H. Kellerer;V. A. Strusevich
Affiliations:
Institut für Statistik und Operations Research, Universität Graz, Universitätstraße 15, A-8010, Graz, Austria;School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Park Row, Greenwich, London SE10 9LS, UK
Venue:
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Year:
2003

Citing 5
Cited 8

Two machine open shop scheduling problem with setup, processing and removal times separated

Computers and Operations Research
Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Lagrangian-Based Solution Approaches for a Resource-Constrained Parallel Machine Scheduling Problem with Machine Eligibility Restrictions

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server

Computers and Industrial Engineering
A job-shop problem with one additional resource type

Journal of Scheduling
Parallel machine scheduling with additional resources: a lagrangian-based constraint programming approach

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Scheduling parallel jobs with linear speedup

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Unrelated parallel machine scheduling with resource dependent processing times

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

Computers and Operations Research
Scheduling jobs with time-resource tradeoff via nonlinear programming

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.