The following pages link to Andrew Wirth (Q223544):
Displayed 33 items.
- Off-line scheduling with forbidden zones (Q340311) (← links)
- On-line machine scheduling with batch setups (Q604758) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- Heuristic stability: a permutation disarray measure (Q883278) (← links)
- On-line scheduling with non-crossing constraints (Q957355) (← links)
- On-line scheduling of two parallel machines with a single server (Q960401) (← links)
- Using case based reasoning for basis development in intelligent decision systems (Q1333472) (← links)
- Large scale linear programs and heuristics for the design of survivable telecommunication networks (Q1417789) (← links)
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server (Q1761158) (← links)
- Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
- Manufacturing flexibility: Measures and relationships (Q1806606) (← links)
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic (Q1847145) (← links)
- Equal processing and equal setup time cases of scheduling parallel machines with a single server (Q1885956) (← links)
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
- Scheduling two parallel machines with a single server: the general case (Q2571191) (← links)
- Online Machine Scheduling with Family Setups (Q2821094) (← links)
- (Q2910188) (← links)
- ON-LINE SCHEDULING OF EMPTY CONTAINERS (Q2920363) (← links)
- Fast heuristics for protection networks for dynamic routing (Q3157322) (← links)
- Convergence in partially ordered groups (Q3214982) (← links)
- (Q3866638) (← links)
- (Q3988843) (← links)
- Some Krein-Milman theorems for order-convexity (Q4044640) (← links)
- Carriers and Archimedean Classes in Banach Lattices (Q4058707) (← links)
- Locally compact tight Riesz groups (Q4063513) (← links)
- Relatively Uniform Banach Lattices (Q4403303) (← links)
- (Q4668755) (← links)
- Comparing deterministic, robust and online scheduling using entropy (Q4681156) (← links)
- Order and norm convergence in Banach lattices (Q4774561) (← links)
- On-line scheduling with forbidden zones (Q5292806) (← links)
- Compatible tight Riesz orders (Q5677537) (← links)
- Scheduling parallel machines with a single server: Some solvable cases and heuristics (Q5952789) (← links)