The following pages link to Journal of Scheduling (Q177699):
Displaying 50 items.
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
- The venue management problem: setting staffing levels, shifts and shift schedules at concession stands (Q2327959) (← links)
- An efficient train scheduling algorithm on a single-track railway system (Q2327960) (← links)
- Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients (Q2327961) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness (Q2341390) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook (Q2341393) (← links)
- Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic (Q2341394) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
- Energetic reasoning for energy-constrained scheduling with a continuous resource (Q2356117) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Minimizing the expected makespan of a project with stochastic activity durations under resource constraints (Q2356119) (← links)
- The impact of core precedences in a cyclic RCPSP with precedence delays (Q2356120) (← links)
- Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization (Q2356121) (← links)
- A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122) (← links)
- Trading off due-date tightness and job tardiness in a basic scheduling model (Q2356123) (← links)
- A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124) (← links)
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints (Q2356125) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- Erratum to: ``A survey on offline scheduling with rejection'' (Q2356127) (← links)
- Erratum to: ``Flow shops with WIP and value added costs'' (Q2356128) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Scheduling of multi-class multi-server queueing systems with abandonments (Q2398642) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- A hybrid multi-objective immune algorithm for predictive and reactive scheduling (Q2398647) (← links)
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
- Batched bin packing revisited (Q2398649) (← links)
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Non-preemptive buffer management for latency sensitive packets (Q2400042) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- Continuous-time production, distribution and financial planning with periodic liquidity balancing (Q2400433) (← links)
- The local-global conjecture for scheduling with non-linear cost (Q2400434) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Optimal scheduling of contract algorithms with soft deadlines (Q2400436) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence (Q2400438) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Preface to the multidisciplinary international scheduling conference: theory and applications (MISTA), 2009 (Q2434247) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays (Q2434252) (← links)
