The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- The flexibility of home away pattern sets (Q6090216) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
- Local search approaches for the test laboratory scheduling problem with variable task grouping (Q6090219) (← links)
- Graph representation of the fixed route dial-a-ride problem (Q6090221) (← links)
- Simulated annealing with penalization for university course timetabling (Q6090224) (← links)
- Editorial: journal of scheduling (2023) (Q6102840) (← links)
- A quest for a fair schedule: the international Young Physicists' Tournament (Q6102843) (← links)
- How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring (Q6102844) (← links)
- Collaborative optimization of workshop layout and scheduling (Q6102846) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints (Q6102850) (← links)
- Scheduling a pick and place packaging line (Q6103745) (← links)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
- Minimizing the expected waiting time of emergency jobs (Q6103747) (← links)
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity (Q6116026) (← links)
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs (Q6116027) (← links)
- Mathematical challenges in scheduling theory (Q6124767) (← links)
- Approximation algorithms for batch scheduling with processing set restrictions (Q6124768) (← links)
- Competitive algorithms for demand response management in a smart grid (Q6124769) (← links)
- Lot streaming for a two-stage assembly system in the presence of handling costs (Q6136078) (← links)
- Exact and metaheuristic methods for a real-world examination timetabling problem (Q6136080) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms (Q6136082) (← links)
- A note on the shifting bottleneck procedure for job shop scheduling (Q6136083) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
- Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling (Q6173707) (← links)
- A note on a single-shift days-off scheduling problem with sequence-dependent labor costs (Q6173709) (← links)
- On the complexity of open shop scheduling with time lags (Q6173710) (← links)
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)
- An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
- Dynamic personnel rescheduling: insights and recovery strategies (Q6547125) (← links)
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)
- The price of anarchy for a berth allocation game (Q6547129) (← links)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)
- Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model (Q6547131) (← links)
- The preemptive resource allocation problem (Q6547132) (← links)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
- A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients (Q6547135) (← links)
- Scheduling with non-renewable resources: minimizing the sum of completion times (Q6547136) (← links)
- A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment (Q6547137) (← links)
- A scheduling framework for distributed key-value stores and its application to tail latency minimization (Q6547138) (← links)
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times (Q6547139) (← links)
- Dynamic scheduling problems in theory and practice (Q6577338) (← links)
