The following pages link to NP-complete scheduling problems (Q1220386):
Displayed 27 items.
- Single machine scheduling subject to precedence delays (Q2563923) (← 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)
- 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)
- 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)