The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Optimal robot scheduling for web search engines (Q1268846) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- Approximation schemes for scheduling on parallel machines (Q1268852) (← links)
- Installing an urban transport scheduling system (Q1283914) (← links)
- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques (Q1283915) (← links)
- Cyclic scheduling in 3-machine robotic flow shops (Q1283916) (← links)
- Scheduling multicast input-queued switches (Q1295833) (← links)
- Minimizing makespan in a pallet-constrained flowshop (Q1295835) (← links)
- Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines (Q1295836) (← links)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- Single-vehicle scheduling with time window constraints (Q1297696) (← links)
- A hybrid genetic/optimization algorithm for a task allocation problem (Q1297698) (← links)
- Scheduling of multi-spindle CNC gantry mills (Q1347599) (← links)
- Cyclic scheduling in a robotic production line (Q1347600) (← links)
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality (Q1347601) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- Special issue: Efficient scheduling algorithms. 6 papers from ESA 2000 and APPROX 2000, both in Saarbrücken, Germany, September 5--8, 2000 (Q1348734) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Scheduling broadcasts in wireless networks (Q1348738) (← links)
- Jitter regulation in an Internet router with delay constraint (Q1348739) (← links)
- Partial servicing of on-line jobs (Q1348740) (← links)
- Scheduling and lot streaming in flowshops with no-wait in process (Q1404270) (← links)
- Complexity of one-cycle robotic flow-shops (Q1404271) (← links)
- Performance bounds of algorithms for scheduling advertisements on a web page (Q1404272) (← links)
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness (Q1404273) (← links)
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs (Q1404274) (← links)
- `Aversion dynamics' scheduling when the system changes (Q1567297) (← links)
- Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- A large step random walk for minimizing total weighted tardiness in a job shop (Q1579121) (← links)
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem (Q1579122) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Integration of continuous caster and hot strip mill planning for steel production (Q1585914) (← links)
- Non-bottleneck machines in three-machine flow shops (Q1585915) (← links)
- A multiagent society for military transportation scheduling (Q1585916) (← links)
- Special issue: Approximation algorithms. Pt. 1 (Q1588052) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- Dynamic spectrum allocation: the impotency of duration notification. (Q1588057) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- Solution of the single machine total tardiness problem (Q1592283) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling (Q1592285) (← links)
- Special issue: Approximation algorithms. Pt. 2 (Q1592753) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- On-line scheduling revisited (Q1592757) (← links)
