The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- Algorithms and complexity analysis for robust single-machine scheduling problems (Q906553) (← links)
- Scheduling with returnable containers (Q906554) (← links)
- Robust execution strategies for project scheduling with unreliable resources and stochastic durations (Q906557) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
- Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
- Batching and scheduling in a multi-machine flow shop (Q954247) (← links)
- List scheduling for jobs with arbitrary release times and similar lengths (Q954249) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- Finding good nurse duty schedules: a case study (Q954255) (← links)
- On-line scheduling of parallel jobs in a list (Q954256) (← links)
- A random generator of resource-constrained multi-project network problems (Q964864) (← links)
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Q964867) (← links)
- Group-scheduling problems in electronics manufacturing (Q964869) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Minimizing the total weighted completion time in the relocation problem (Q964872) (← links)
- A university-timetabling problem and its solution using Benders' partitioning---a case study (Q964875) (← links)
- An improved constraint satisfaction adaptive neural network for job-shop scheduling (Q969749) (← links)
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem (Q969750) (← links)
- Parallel machine match-up scheduling with manufacturing cost considerations (Q969751) (← links)
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions (Q969752) (← links)
- Flow shops with WIP and value added costs (Q969753) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Parallel machine scheduling with multiple unloading servers (Q983625) (← links)
- Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models (Q983626) (← links)
- Rescheduling in passenger railways: The rolling stock rebalancing problem (Q983628) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- A decomposition scheme for single stage scheduling problems (Q983632) (← links)
- Throughput optimization in two-machine flowshops with flexible operations (Q983633) (← links)
- Special issue: 8th workshop on models and algorithms for planning (MAPSP 2007). Selected papers based on the presentations at the workshop, Istanbul, Turkey, July 2-6, 2007 (Q1041337) (← links)
- Bounded-space online bin cover (Q1041340) (← links)
- Inverse scheduling with maximum lateness objective (Q1041341) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Non-approximability of just-in-time scheduling (Q1041346) (← links)
- Conjugate problems in time-dependent scheduling (Q1041348) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Power-aware scheduling for makespan and flow (Q1041350) (← links)
- The resource-constrained activity insertion problem with minimum and maximum time lags (Q1041351) (← links)
- Algorithms for testing fault-tolerance of sequenced jobs (Q1041352) (← links)
- Special issue: Selected papers based on the presentations at the multidisciplinary international scheduling theory and applications (MISTA) conference, Paris, France, August 28--31, 2007. (Q1041825) (← links)
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835) (← links)
- Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836) (← links)
- Minimizing total weighted completion time in a proportionate flow shop (Q1268838) (← links)
- A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times (Q1268839) (← links)
- The ODO project: Toward a unified basis for constraint-directed scheduling (Q1268843) (← links)
- The mystical power of twoness: In memoriam Eugene L. Lawler (Q1268844) (← links)
