Pages that link to "Item:Q4140712"
From MaRDI portal
The following pages link to Complexity Results for Multiprocessor Scheduling under Resource Constraints (Q4140712):
Displaying 50 items.
- Complexity of equilibrium in competitive diffusion games on social networks (Q273917) (← links)
- Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units (Q393040) (← links)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
- On the calendar planning problem with renewable resource (Q461985) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (Q692666) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Event-based MILP models for resource-constrained project scheduling problems (Q709100) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- On the complexity of iterated shuffle (Q800086) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Maximizing data locality in distributed systems (Q856409) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- On the continuous working problem (Q917431) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- Scheduling subject to resource constraints: Classification and complexity (Q1052820) (← links)
- The complexity of the 0/1 multi-knapsack problem (Q1076516) (← links)
- Scheduling tasks on two processors with deadlines and additional resources (Q1084012) (← links)
- Minimizing mean flow time with parallel processors and resource constraints (Q1084859) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628) (← links)
- NP-complete scheduling problems (Q1220386) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- Bounds on list scheduling of UET tasks with restricted resource constraints (Q1259426) (← links)
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application (Q1291582) (← links)
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. (Q1413824) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- On the complexity of coordinated display of multimedia objects (Q1575545) (← links)
- Scheduling periodic tasks on uniform multiprocessors (Q1603357) (← links)
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
- Tabu search in audit scheduling (Q1609901) (← links)
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Some remarks on 3-partitions of multisets (Q1739914) (← links)
- Optimizing version release dates of research and development long-term processes (Q1751861) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- A linear time algorithm for restricted bin packing and scheduling problems (Q1837623) (← links)
- Bin packing and multiprocessor scheduling problems with side constraint on job types (Q1838290) (← links)
- Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems (Q1988965) (← links)
- On \(k\)-partitions of multisets with equal sums (Q2038988) (← links)
- Complexity of Lambek calculi with modalities and of total derivability in grammars (Q2066100) (← links)
- Production, maintenance and resource scheduling: a review (Q2098022) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
