Complexity Results for Multiprocessor Scheduling under Resource Constraints

Cited in

(only showing first 100 items - show all)

Scheduling subject to resource constraints: Classification and complexity
The complexity of the 0/1 multi-knapsack problem
Scheduling tasks on two processors with deadlines and additional resources
Minimizing mean flow time with parallel processors and resource constraints
New trends in machine scheduling
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem
NP-complete scheduling problems
Resource constrained scheduling as generalized bin packing
Bounds on list scheduling of UET tasks with restricted resource constraints
Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application
Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
An experimental analysis of local minima to improve neighbourhood search.
On the complexity of coordinated display of multimedia objects
Scheduling periodic tasks on uniform multiprocessors
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
Tabu search in audit scheduling
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
Restricted assignment scheduling with resource constraints
On the classes of interval graphs of limited nesting and count of lengths
Some remarks on 3-partitions of multisets
Optimizing version release dates of research and development long-term processes
Mathematical models and decomposition methods for the multiple knapsack problem
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
Two simulated annealing-based heuristics for the job shop scheduling problem
A linear time algorithm for restricted bin packing and scheduling problems
Bin packing and multiprocessor scheduling problems with side constraint on job types
Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems
On \(k\)-partitions of multisets with equal sums
Complexity of Lambek calculi with modalities and of total derivability in grammars
Production, maintenance and resource scheduling: a review
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
On optimal coverage of a tree with multiple robots
Weighted total acquisition
Upward point set embeddings of paths and trees
Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms
Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
Extending partial representations of subclasses of chordal graphs
Scheduling with an orthogonal resource constraint
Parallel machine scheduling with additional resources: notation, classification, models and solution methods
Small polyomino packing
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
New results in two identical machines scheduling with agreement graphs
Shiftable intervals
Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
Structure and complexity of extreme Nash equilibria
Scheduling: agreement graph vs resource constraints
An improved algorithm for parallel machine scheduling under additional resource constraints
Allocation of partially renewable resources: Concept, capabilities, and applications
Complexity of equilibrium in competitive diffusion games on social networks
On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
Dissection with the fewest pieces is hard, even to approximate
Bounds for the convergence time of local search in scheduling problems
Output rate variation problem: some heuristic paradigms and dynamic programming
Scheduling on Two Unbounded Resources with Communication Costs
Do branch lengths help to locate a tree in a phylogenetic network?
Towards optimal formwork pairing on construction sites
Comparison of lower bounds to the lengths of deterministic multiprocessor schedules
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Multitask n-vehicle exploration problem: complexity and algorithm
NP-Complete operations research problems and approximation algorithms
Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach
On the calendar planning problem with renewable resource
Scheduling Opposing Forests
TETRIS IS HARD, EVEN TO APPROXIMATE
Approximation schemes for machine scheduling with resource (in-)dependent processing times
scientific article; zbMATH DE number 7376042 (Why is no real title available?)
Single machine group scheduling with family setups to minimize total tardiness
Complexity of project scheduling problem with nonrenewable resources
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
Treemaps for Directed Acyclic Graphs
On the membership problem of permutation grammars -- a direct proof of NP-completeness
Approximation algorithms for replenishment problems with fixed turnover times
Realization problems on reachability sequences
Fast parallel heuristics for the job shop scheduling problem
Extending partial representations of circular-arc graphs
Priority-based bin packing with subset constraints
Bounding and computing obstacle numbers of graphs
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
Improved scheduling with a shared resource
\( \gamma \)-clustering problems: classical and parametrized complexity
A multi-objective flexible flow shop scheduling problem with an improved NSGA-II algorithm
Distributed parallel build for the Isabelle archive of formal proofs
Fifty years of research on resource-constrained project scheduling explored from different perspectives
Dynamic batching of online arrivals to leverage economies of scale
Scheduling on a stochastic number of machines
Single machine scheduling with few deadlines
A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit
FPT implicit enumeration of active schedules
Buffer management for colored packets with deadlines
Bounding and computing obstacle numbers of graphs
Partial and constrained level planarity
Event-based MILP models for resource-constrained project scheduling problems
Packing squares into a disk with optimal worst-case density
Assortment optimization with visibility constraints
Partitioning problems with splittings and interval targets
Approximation algorithms for scheduling unrelated parallel machines
Network flows and non-guillotine cutting patterns
On the complexity of iterated shuffle
Scheduling with conflicts: Online and offline algorithms

This page was built for publication: Complexity Results for Multiprocessor Scheduling under Resource Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140712)