Wirth Andrew

Andrew Wirth

Information about the author Andrew Wirth will soon be added to the site.
Found 19 papers in total
Off‐line scheduling with forbidden zones
Off‐line scheduling with forbidden zones
2013
In various manufacturing and computing environments there may be certain time...
A branch‐and‐price algorithm for the general case of scheduling parallel machines with a single server
A branch‐and‐price algorithm for the general case of scheduling parallel machines with a single server
2012
We consider the strongly NP‐hard problem of scheduling two‐operation...
On-line machine scheduling with batch setups
On-line machine scheduling with batch setups
2010
We study a class of scheduling problems with batch setups for the online-list and...
On-line scheduling with non-crossing constraints
On-line scheduling with non-crossing constraints
2008
We consider the problem of on-line scheduling with non-crossing constraints. The...
Heuristic stability: A permutation disarray measure
Heuristic stability: A permutation disarray measure
2007
Heuristic performance has been mainly measured by effectiveness (near optimality) and...
Scheduling two parallel machines with a single server: the general case
Scheduling two parallel machines with a single server: the general case
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on...
Getting out of a (strawberry) jam: An introduction to supply chain analysis
Getting out of a (strawberry) jam: An introduction to supply chain analysis
2005
In order to illustrate how various areas of operations research interact in an actual...
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
2005
This paper investigates branch-and-bound algorithms for the problem of scheduling jobs...
Heuristic methods for the identical parallel machine flowtime problem with set-up times
Heuristic methods for the identical parallel machine flowtime problem with set-up times
2005
We consider the scheduling of N jobs divided into G families for processing on M...
Comparing deterministic, robust and online scheduling using entropy
Comparing deterministic, robust and online scheduling using entropy
2005
We conjecture that when the uncertainty of scheduling information increases, one...
Earliness/tardiness scheduling with a common due date and family setups
Earliness/tardiness scheduling with a common due date and family setups
2004
We examine the problem of scheduling jobs, on a single processor to minimise the total...
Equal processing and equal setup time cases of scheduling parallel machines with a single server
Equal processing and equal setup time cases of scheduling parallel machines with a single server
2004
This paper considers the deterministic problem of scheduling two-operation...
Large scale linear programs and heuristics for the design of survivable telecommunications networks
Large scale linear programs and heuristics for the design of survivable telecommunications networks
2003
We consider the problem of providing a minimum cost multi-service network subject to...
Scheduling parallel machines with a single server: Some solvable cases and heuristics
Scheduling parallel machines with a single server: Some solvable cases and heuristics
2002
This paper considers the problem of scheduling two identical parallel machines with a...
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
2000
We consider the scheduling of N jobs divided into G families for processing on a...
Manufacturing flexibility: Measures and relationships
Manufacturing flexibility: Measures and relationships
1999
The study and formulation of manufacturing flexibility measures has been inhibited by...
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
1999
We investigate network planning and design under volatile conditions of link failures...
Using case based reasoning for basis development in intelligent decision systems
Using case based reasoning for basis development in intelligent decision systems
1994
The artificial intelligence technique of case based reasoning is proposed to support...
A new heuristic for a single machine scheduling problem with set-up times
A new heuristic for a single machine scheduling problem with set-up times
1996
This paper examines the problem of scheduling jobs on a single machine with set-up...
Papers per page: