Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
From MaRDI portal
Publication:1803669
DOI10.1016/0166-218X(93)90042-MzbMath0792.68012WikidataQ57387894 ScholiaQ57387894MaRDI QIDQ1803669
Silvano Martello, Wiesław X. Kubiak, Jacek Błażewicz
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Production, maintenance and resource scheduling: a review, Parallel machine scheduling with additional resources: notation, classification, models and solution methods
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling tasks on two processors with deadlines and additional resources
- Minimizing mean flow time with parallel processors and resource constraints
- Coffman-Graham scheduling of UET task systems with 0-1 resources
- Simple algorithms for multiprocessor scheduling to meet deadlines
- Bounds on list scheduling of UET tasks with restricted resource constraints
- A linear time algorithm for restricted bin packing and scheduling problems
- Some new results in flow shop scheduling
- Preemptive Scheduling, Linear Programming and Network Flows
- Concurrent Task Systems
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
