The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- On-line and off-line preemptive two-machine job shop scheduling (Q1592758) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- Scheduling space-sharing for internet advertising (Q1600000) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- A new dynamic look-ahead scheduling procedure for batching machines (Q1600008) (← links)
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- The complexity of cyclic shop scheduling problems (Q1607980) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- Two-stage hybrid flowshop scheduling with simultaneous processing machines (Q1617273) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- An implicit model for multi-activity shift scheduling problems (Q1617280) (← links)
- The triangle scheduling problem (Q1617282) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- Single machine scheduling with job delivery to multiple customers (Q1617286) (← links)
- New strategies for stochastic resource-constrained project scheduling (Q1617288) (← links)
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem (Q1617289) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
- Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
- Special issue: Twelfth workshop on ``Models and algorithms for planning and scheduling problems (MAPSP 2015)'' (Q1702654) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Staff and machine shift scheduling in a German potash mine (Q1702661) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence (Q1702665) (← links)
- Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
- Throughput maximization for speed scaling with agreeable deadlines (Q1702723) (← links)
- Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
- Optimizing memory allocation for multistage scheduling including setup times (Q1702728) (← links)
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines (Q1702729) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
