The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
- The proactive and reactive resource-constrained project scheduling problem (Q2281615) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- A note on minimizing total weighted completion time with an unexpected machine unavailable interval (Q2281620) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Scheduling parallel batching machines in a sequence (Q2283298) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals (Q2286432) (← links)
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435) (← links)
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines (Q2286436) (← links)
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity (Q2286437) (← links)
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints (Q2294889) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Single machine scheduling with stochastically dependent times (Q2294892) (← links)
- Single-machine scheduling with job-dependent machine deterioration (Q2294893) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- Parallel machine makespan minimization subject to machine availability and total completion time constraints (Q2304115) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Lower bounds for online bin covering-type problems (Q2304119) (← links)
- Journal of scheduling (2020) (Q2305015) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Minimizing the waiting time for a one-way shuttle service (Q2305017) (← links)
- Approximation algorithms for the twin robot scheduling problem (Q2305018) (← links)
- Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures (Q2305019) (← links)
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines (Q2317128) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
- Admission control in shared memory switches (Q2317132) (← links)
- Rescheduling due to machine disruption to minimize the total weighted completion time (Q2317133) (← links)
- In memoriam: Dr. Joseph Leung (Q2317135) (← links)
- Shared processor scheduling (Q2317136) (← links)
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines (Q2317137) (← links)
- Scheduling fully parallel jobs (Q2317138) (← links)
- Speed scaling problems with memory/cache consideration (Q2317139) (← links)
- Online scheduling of moldable parallel tasks (Q2317140) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
