The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce (Q282236) (← links)
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- Relocation scheduling subject to fixed processing sequences (Q282245) (← links)
- Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times (Q282247) (← links)
- Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- A survey of offline algorithms for energy minimization under deadline constraints (Q283261) (← links)
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263) (← links)
- MP or not MP: that is the question (Q283264) (← links)
- A genetic algorithm for the robust resource leveling problem (Q283265) (← links)
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- A mixed integer programming approach to multi-skilled workforce scheduling (Q283273) (← links)
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing (Q309050) (← links)
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays (Q309052) (← links)
- Temporal linear relaxation in IBM ILOG CP optimizer (Q309055) (← links)
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- Late acceptance hill-climbing for high school timetabling (Q309068) (← links)
- Scheduling evacuation operations (Q309072) (← links)
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem (Q310327) (← links)
- Line search method for solving a non-preemptive strictly periodic scheduling problem (Q310329) (← links)
- Novel dual discounting functions for the Internet shopping optimization problem: new algorithms (Q310335) (← links)
- Real-life examination timetabling (Q310336) (← links)
- The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge (Q310341) (← links)
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem (Q310345) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- A decision support approach to automatic timetabling in higher education institutions (Q310350) (← links)
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks (Q310353) (← links)
- Scheduling operating rooms: achievements, challenges and pitfalls (Q341461) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- A reclaimer scheduling problem arising in coal stockyard management (Q341465) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
- Real-time integrated prefetching and caching (Q398835) (← links)
- Mixed-integer linear programming models for batch sterilization of packaged-foods plants (Q398836) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Online capacity maximization in wireless networks (Q398842) (← links)
- Fast minimum float computation in activity networks under interval uncertainty (Q398844) (← links)
- Exact algorithms for inventory constrained scheduling on a single machine (Q398845) (← links)
- Fair online load balancing (Q398848) (← links)
- Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
