The following pages link to NP-complete scheduling problems (Q1220386):
Displayed 50 items.
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing (Q2301940) (← links)
- Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
- A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
- Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics (Q2366078) (← links)
- Scheduling with constrained processor allocation for interval orders (Q2367418) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Probabilistic quality estimations for combinatorial optimization problems (Q2413265) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems (Q2481602) (← links)
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems (Q2489280) (← links)
- Graph layering by promotion of nodes (Q2489908) (← links)
- Single machine scheduling subject to precedence delays (Q2563923) (← links)
- An improved coral reef optimization-based scheduling algorithm for cloud computing (Q2666146) (← links)
- (Q2741353) (← links)
- (Q2741499) (← links)
- Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650) (← links)
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561) (← links)
- Scheduling DAG-based applications in multicluster environments with background workload using task duplication (Q3056374) (← links)
- A Comparison of Random Task Graph Generation Methods for Scheduling Problems (Q3297563) (← links)
- Modeling Block Structured Project Scheduling with Resource Constraints (Q3297730) (← links)
- On some implementations of solving the resource constrained project scheduling problems (Q3388406) (← links)
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873) (← links)
- Profile Scheduling of Opposing Forests and Level Orders (Q3698629) (← links)
- (Q3856087) (← links)
- Effective solution of certain problems of theory of schedulings of nets (Q3899515) (← links)
- Upper bound of the duration of the shortest schedule in one class of Hu problems (Q3902465) (← links)
- Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem (Q4007453) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- On the Complexity of Scheduling to Optimize Average Response Time (Q4272552) (← links)
- A genetic algorithm approach to high-level synthesis of digital circuits (Q4346470) (← links)
- On-line Scheduling with Optimal Worst-Case Response Time (Q4718601) (← links)
- Scheduling Opposing Forests (Q4745255) (← links)
- AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION (Q4820007) (← links)
- ON CONSIDERING COMMUNICATION IN SCHEDULING TASK GRAPHS ON PARALLEL PROCESSORS (Q4820018) (← links)
- ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING (Q4820124) (← links)
- SCHEDULING INTERVAL ORDERS IN PARALLEL (Q4820141) (← links)
- (Q4852904) (← links)
- (Q5140795) (← links)
- Block structured scheduling using constraint logic programming (Q5145461) (← links)
- TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS (Q5249280) (← links)
- Scheduling Massively Parallel Multigrid for Multilevel Monte Carlo Methods (Q5372658) (← links)
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS (Q5708845) (← links)
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES (Q5716131) (← links)
- Performance of critical path type algorithms for scheduling on parallel processors (Q5949904) (← links)
- Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
- A quest for a fair schedule: the international Young Physicists' Tournament (Q6102843) (← links)