The following pages link to (Q4821818):
Displaying 29 items.
- Fixed-Parameter Approximation Schemes for Weighted Flowtime. (Q5009522) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
- ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH (Q5070863) (← links)
- (Q5077832) (← links)
- (Q5091067) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Method of rescheduling for hybrid production lines with intermediate buffers (Q5150030) (← links)
- Achievable Performance of Blind Policies in Heavy Traffic (Q5219677) (← links)
- DYNAMIC CONTROL OF A SINGLE-SERVER SYSTEM WHEN JOBS CHANGE STATUS (Q5242840) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- Online Algorithm for Parallel Job Scheduling and Strip Packing (Q5443373) (← links)
- (Q5743409) (← links)
- Timetabling problems at the TU Eindhoven (Q5902305) (← links)
- Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- Similarities between meta-heuristics algorithms and the science of life (Q5965643) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
- (Q6065401) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- On Ordering Problems: A Statistical Approach (Q6092952) (← links)
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions (Q6112735) (← links)
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem (Q6146639) (← links)
- Preference based scheduling in a healthcare provider network (Q6167379) (← links)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)