The following pages link to (Q4821818):
Displayed 41 items.
- Combined task- and network-level scheduling for distributed time-triggered systems (Q258438) (← links)
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets (Q297414) (← links)
- Novel dual discounting functions for the Internet shopping optimization problem: new algorithms (Q310335) (← links)
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost (Q319441) (← links)
- A MILP model for the teacher assignment problem considering teachers' preferences (Q321129) (← links)
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- Minimising maximum response time (Q336510) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- Energy-oriented scheduling based on evolutionary algorithms (Q337370) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking (Q342261) (← links)
- 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)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- Single-processor scheduling with time restrictions (Q490336) (← links)
- Better permutations for the single-processor scheduling with time restrictions (Q523167) (← 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)
- Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← links)
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- Parallel load balancing strategy for volume-of-fluid methods on 3-D unstructured meshes (Q728876) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)