The following pages link to (Q4821818):
Displayed 50 items.
- Decentralized list scheduling (Q367649) (← links)
- Breaks, cuts, and patterns (Q408430) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics (Q433416) (← links)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Load-balancing spatially located computations using rectangular partitions (Q455987) (← links)
- Scheduling of coupled tasks with unit processing times (Q600841) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
- Modelling and solving grid resource allocation problem with network resources for workflow applications (Q640301) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- A scheduling framework for large-scale, parallel, and topology-aware applications (Q666224) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan (Q941557) (← links)
- Construction of balanced sports schedules using partitions into subleagues (Q943779) (← links)
- Apportionment methods and the Liu-Layland problem (Q954936) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- Score calculation from final tournament tables (Q955626) (← links)
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables (Q958431) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- Idle regulation in non-clairvoyant scheduling of parallel jobs (Q1003681) (← links)
- Scheduling a maintenance activity and due-window assignment on a single machine (Q1010256) (← links)
- Sequencing mixed-model assembly lines: survey, classification and model critique (Q1011163) (← links)
- The product rate variation problem and its relevance in real world mixed-model assembly lines (Q1015006) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Minimizing costs in round robin tournaments with place constraints (Q1025238) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- Mathematical programming modeling of the response time variability problem (Q1042486) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times (Q1761176) (← links)
- Scheduling on parallel machines with preemption and transportation delays (Q1761986) (← links)
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994) (← links)