The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- Australian sugar mills optimise siding rosters to increase profitability (Q596441) (← links)
- A quantitative method for determining proper job rotation intervals (Q596444) (← links)
- Maximization problems in single machine scheduling (Q596446) (← links)
- A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449) (← links)
- Scheduling tasks with small communication delays for clusters of processors (Q596450) (← links)
- Scheduling malleable tasks on parallel processors to minimize the makespan (Q596452) (← links)
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays (Q596453) (← links)
- Solving examination timetabling problems through adaption of heuristic orderings (Q596455) (← links)
- Simultaneous job scheduling and resource allocation on parallel machines (Q596456) (← links)
- Planning activities in a network of logistic platforms with shared resources (Q596457) (← links)
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459) (← links)
- Lower bounds for scheduling on identical parallel machines with heads and tails (Q596460) (← links)
- An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines (Q596461) (← links)
- Emergency logistics planning in natural disasters (Q596464) (← links)
- A note on permutation flow shop problem (Q596465) (← links)
- Single-machine scheduling with release times and tails (Q596466) (← links)
- Special issue: Computational intelligence and scheduling. Selected papers based on the presentations at the 2007 IEEE symposium, Honolulu, HI, USA, April 1--5, 2007. (Q600790) (← links)
- Stochastic dynamic nursing service budgeting (Q601151) (← links)
- Dimensioning hospital wards using the Erlang loss model (Q601152) (← links)
- Time-dependent analysis for refused admissions in clinical wards (Q601153) (← links)
- A loss network model with overflow for capacity planning of a neonatal unit (Q601157) (← links)
- To pool or not to pool in hospitals: a theoretical and practical comparison for a radiotherapy outpatient department (Q601160) (← links)
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP) (Q601161) (← links)
- Clinic scheduling models with overbooking for patients with heterogeneous no-show probabilities (Q601164) (← links)
- Scheduling preparation of doses for a chemotherapy service (Q601167) (← links)
- Queueing models for appointment-driven systems (Q601169) (← links)
- Small world network models of the dynamics of HIV infection (Q601173) (← links)
- Quality competition for screening and treatment services (Q601176) (← links)
- Optimal control of dosage decisions in controlled ovarian hyperstimulation (Q601178) (← links)
- Models and algorithms for fair layout optimization problems (Q610957) (← links)
- Bun splitting: a practical cutting stock problem (Q610959) (← links)
- New perspectives in VLSI design automation: deterministic packing by sequence pair (Q610960) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- The multi-story space assignment problem (Q610966) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- The location and allocation of products and product families on retail shelves (Q610968) (← links)
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic (Q610971) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- Optimal rectangle packing (Q610984) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Tools of mathematical modeling of arbitrary object packing problems (Q610987) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
- Part special issue: Applied optimization in manufacturing and services (APPOPT-2008). Selected papers based on the presentations at the ``Application track'' of the 9th international conference on approximation and optimization in the Caribbean, San Andre (Q612876) (← links)
- A multiobjective framework for heavily constrained examination timetabling problems (Q613763) (← links)
