Andrew Wirth

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Off-line scheduling with forbidden zones
Computers & Operations Research
2016-11-14Paper
Online machine scheduling with family setups
Asia-Pacific Journal of Operational Research
2016-09-16Paper
A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
Computers & Operations Research
2012-11-15Paper
On-line scheduling of empty containers
Asia-Pacific Journal of Operational Research
2012-10-16Paper
John Boris Miller
The Australian Mathematical Society Gazette
2012-09-07Paper
The query complexity of estimating weighted averages
Acta Informatica
2012-03-23Paper
On-line machine scheduling with batch setups
Journal of Combinatorial Optimization
2010-11-12Paper
On-line scheduling of two parallel machines with a single server
Computers & Operations Research
2008-12-17Paper
On-line scheduling with non-crossing constraints
Operations Research Letters
2008-11-27Paper
On-line scheduling with forbidden zones
The Journal of the Operational Research Society
2007-06-25Paper
Heuristic stability: a permutation disarray measure
Computers & Operations Research
2007-06-04Paper
Scheduling two parallel machines with a single server: the general case
Computers & Operations Research
2005-11-01Paper
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
European Journal of Operational Research
2005-08-04Paper
Comparing deterministic, robust and online scheduling using entropy
International Journal of Production Research
2005-06-14Paper
Heuristic methods for the identical parallel machine flowtime problem with set-up times
Computers & Operations Research
2005-04-21Paper
scientific article; zbMATH DE number 2156296 (Why is no real title available?)2005-04-15Paper
Fast heuristics for protection networks for dynamic routing
The Journal of the Operational Research Society
2005-01-13Paper
Equal processing and equal setup time cases of scheduling parallel machines with a single server
Computers & Operations Research
2004-11-12Paper
Large scale linear programs and heuristics for the design of survivable telecommunication networks
Annals of Operations Research
2004-01-06Paper
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
European Journal of Operational Research
2002-11-17Paper
Scheduling parallel machines with a single server: Some solvable cases and heuristics
Computers & Operations Research
2002-09-30Paper
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
Journal of Scheduling
2000-09-19Paper
Manufacturing flexibility: Measures and relationships
European Journal of Operational Research
1999-11-08Paper
Using case based reasoning for basis development in intelligent decision systems
European Journal of Operational Research
1995-03-28Paper
scientific article; zbMATH DE number 33260 (Why is no real title available?)1992-06-28Paper
scientific article; zbMATH DE number 3669282 (Why is no real title available?)1980-01-01Paper
Locally compact tight Riesz groups
Journal of the Australian Mathematical Society
1975-01-01Paper
Carriers and Archimedean Classes in Banach Lattices
Journal of the London Mathematical Society
1975-01-01Paper
Relatively Uniform Banach Lattices1975-01-01Paper
Order and norm convergence in Banach lattices
Glasgow Mathematical Journal
1974-01-01Paper
Some Krein-Milman theorems for order-convexity
Journal of the Australian Mathematical Society
1974-01-01Paper
Convergence in partially ordered groups
Proceedings of the Edinburgh Mathematical Society
1973-01-01Paper
Compatible tight Riesz orders
Journal of the Australian Mathematical Society
1973-01-01Paper


Research outcomes over time


This page was built for person: Andrew Wirth