The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Knowledge integration using problem spaces: A study in resource-constrained project scheduling (Q880537) (← links)
- Algorithms for the car sequencing and the level scheduling problem (Q880539) (← links)
- A simulated annealing approach to the traveling tournament problem (Q880541) (← links)
- Operational airline reserve crew planning (Q880544) (← links)
- Scheduling models for air traffic control in terminal areas (Q880545) (← links)
- Duty-period-based network model for crew rescheduling in European airlines (Q880547) (← links)
- Flight operations recovery: New approaches considering passenger recovery (Q880549) (← links)
- Lot-sizing scheduling with batch setup times (Q880550) (← links)
- The task assignment problem for unrestricted movement between workstation groups (Q880551) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks (Q880554) (← links)
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem (Q880555) (← links)
- A note on the complexity of the concurrent open shop problem (Q880556) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- On a parallel machine scheduling problem with precedence constraints (Q880562) (← links)
- A faster polynomial algorithm for 2-cyclic robotic scheduling (Q880563) (← links)
- A case study of mutual routing-scheduling reformulation (Q880564) (← links)
- Single machine batch scheduling problem with family setup times and release dates to minimize makespan (Q880565) (← links)
- Two-machine flow shop problems with a single server (Q880567) (← links)
- Scheduling search procedures: The wheel of fortune (Q880568) (← links)
- Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective: A correction (Q880571) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services (Q880577) (← links)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
- Robust optimization models for project scheduling with resource availability cost (Q880580) (← links)
- Single-machine scheduling with general costs under compound-type distributions (Q880581) (← links)
- Selected papers from the Dagstuhl Workshop (Q880582) (← links)
- Response time variability (Q880584) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Single processor scheduling with job values depending on their completion times (Q880588) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- New perspectives in scheduling theory (Q892831) (← links)
- Scheduling semi-malleable jobs to minimize mean flow time (Q892832) (← links)
- Scheduling parallel batch jobs in grids with evolutionary metaheuristics (Q892833) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- Generating class schedules within a complex modular environment with application to secondary schools (Q892836) (← links)
- Integer programming for the generalized high school timetabling problem (Q892837) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- Flowshop scheduling with interstage job transportation (Q892841) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Improved rolling horizon approaches to the aircraft sequencing problem (Q892901) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
- Decentralized subcontractor scheduling with divisible jobs (Q892907) (← links)
- Optimal control of a two-server flow-shop network (Q892910) (← links)
- Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
