The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Optimizing rest times and differences in games played: an iterative two-phase approach (Q2163747) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
- Exact and meta-heuristic approaches for the production leveling problem (Q2163752) (← links)
- An optimal online algorithm for scheduling with general machine cost functions (Q2173052) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers (Q2173054) (← links)
- Broadcasting a file in a communication network (Q2173055) (← links)
- A polyhedral study of event-based models for the resource-constrained project scheduling problem (Q2173056) (← links)
- A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering (Q2173057) (← links)
- Two-machine flow shops with an optimal permutation schedule under a storage constraint (Q2197318) (← links)
- Optimizing the physician scheduling problem in a large hospital ward (Q2197320) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities (Q2197325) (← links)
- Interruptible algorithms for multiproblem solving (Q2197326) (← links)
- Interference aware scheduling of triple-crossover-cranes (Q2197327) (← links)
- Mixed batch scheduling on identical machines (Q2197328) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189) (← links)
- Dynamic speed scaling minimizing expected energy consumption for real-time tasks (Q2215190) (← links)
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
- Serial-batching scheduling with two agents to minimize makespan and maximum cost (Q2215193) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- Editorial: Dynamic scheduling problems (Q2215195) (← links)
- Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing (Q2215198) (← links)
- Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects (Q2215199) (← links)
- Scheduling in data gathering networks with background communications (Q2215200) (← links)
- Approximation algorithms for energy-efficient scheduling of parallel jobs (Q2215201) (← links)
- New results for an open time-dependent scheduling problem (Q2215202) (← links)
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- A theoretic and practical framework for scheduling in a stochastic environment (Q2268505) (← links)
- The integrated production-inventory-distribution-routing problem (Q2268506) (← links)
- A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
- Solve-and-robustify (Q2268511) (← links)
- The worst-case analysis of the Garey-Johnson algorithm (Q2268512) (← links)
- Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← links)
- A fast heuristic for quay crane scheduling with interference constraints (Q2268514) (← links)
- A survey of dynamic scheduling in manufacturing systems (Q2268515) (← links)
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem (Q2268516) (← links)
- A Lagrangian approach to single-machine scheduling problems with two competing agents (Q2268518) (← links)
- A cyclic approach to large-scale short-term planning in chemical batch production (Q2268519) (← links)
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520) (← links)
- An exact algorithm for single-machine scheduling without machine idle time (Q2268522) (← links)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
