The following pages link to NP-complete scheduling problems (Q1220386):
Displaying 50 items.
- Parallel AFMPB solver with automatic surface meshing for calculation of molecular solvation free energy (Q311614) (← links)
- Hypervolume indicator and dominance reward based multi-objective Monte-Carlo tree search (Q374142) (← links)
- Scheduling in a dynamic heterogeneous distributed system using estimation error (Q436905) (← links)
- A dynamic rescheduling algorithm for resource management in large scale dependable distributed systems (Q453882) (← links)
- Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness (Q499334) (← links)
- Scheduling with uncertainties on new computing platforms (Q535305) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Fast combination of scheduling chains under resource and time constraints (Q886400) (← links)
- Scheduling batches on parallel machines with major and minor set-ups (Q918855) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- First fit decreasing scheduling on uniform multiprocessors (Q1061602) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Applications of scheduling theory to formal language theory (Q1082085) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- UET scheduling with unit interprocessor communication delays (Q1097163) (← links)
- Multiprocessor scheduling with interprocessor communication delays (Q1102743) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- Scheduling on a hypercube (Q1183498) (← links)
- Scheduling with neural networks -- the case of the Hubble Space Telescope (Q1200817) (← links)
- Optimal scheduling of homogeneous job systems (Q1236493) (← links)
- On scheduling multi-processor systems with algebraic objectives (Q1259901) (← links)
- Task scheduling with and without communication delays: A unified approach (Q1266702) (← links)
- Parallelization of automata (Q1288662) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- Optimal scheduling on parallel machines for a new order class (Q1306374) (← links)
- Analysis of scheduling problems with typed task systems (Q1331888) (← links)
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations (Q1333456) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Non-approximability of precedence-constrained sequencing to minimize setups. (Q1421479) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Scheduling of parallel programs on configurable multiprocessors by genetic algorithms (Q1606206) (← links)
- Minimizing the number of stations and station activation costs for a production line (Q1652155) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors (Q1698778) (← links)
- Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
- Lower-bound complexity algorithm for task scheduling on heterogeneous grid (Q1700990) (← links)
- Preemptive scheduling with variable profile, precedence constraints and due dates (Q1805445) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
