The following pages link to (Q4131987):
Displaying 50 items.
- Self-learning genetic algorithm (Q295580) (← links)
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357) (← links)
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines (Q337140) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems (Q436728) (← links)
- Static heuristics for robust resource allocation of continuously executing applications (Q436849) (← links)
- Stochastic robustness metric and its use for static resource allocations (Q436874) (← links)
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions (Q436910) (← links)
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203) (← links)
- Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams (Q595568) (← links)
- Performance bounds on multiprocessor scheduling strategies for statically allocated programs (Q688624) (← links)
- Distribution-free bounds on the expectation of the maximum with scheduling applications (Q751993) (← links)
- Models of central capacity and concurrency (Q762011) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Scheduling independent 2-processor tasks to minimize schedule length (Q796987) (← links)
- Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm (Q806667) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
- Scheduling parallel batch jobs in grids with evolutionary metaheuristics (Q892833) (← links)
- Job oriented production scheduling (Q915631) (← links)
- Scheduling methods for a class of flexible manufacturing systems (Q918390) (← links)
- Multi-level production scheduling for a class of flexible machining and assembly systems (Q918393) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem (Q928082) (← links)
- Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- First fit decreasing scheduling on uniform multiprocessors (Q1061602) (← links)
- Convergence of optimal stochastic bin packing (Q1062627) (← links)
- Games against nature (Q1069296) (← links)
- Scheduling tasks on two processors with deadlines and additional resources (Q1084012) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- UET scheduling with unit interprocessor communication delays (Q1097163) (← links)
- Bin packing problems in one dimension: Heuristic solutions and confidence intervals (Q1098774) (← links)
- Multiprocessor scheduling with interprocessor communication delays (Q1102743) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- Single machine flow-time scheduling with a single breakdown (Q1111018) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- List scheduling in the presence of branches. A theoretical evaluation (Q1128736) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- List scheduling bounds for UET systems with resources (Q1139371) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- A linear-time recognition algorithm for interval dags (Q1149762) (← links)
- A note on preemptive scheduling of periodic, real-time tasks (Q1152707) (← links)
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs (Q1152708) (← links)
- Methods and means of parallel processing of information (Q1155954) (← links)
- The complexity of a multiprocessor task assignment problem without deadlines (Q1155958) (← links)
