Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
John W. Fowler
Information about the author John W. Fowler will soon be added to the site.
Found
20 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Scheduling jobs on parallel machines with setup times and ready times
2008
In this research we are interested in scheduling jobs with ready times on identical...
A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
2008
In this research, we model a semiconductor wafer fabrication process as a complex job...
Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
2007
In this paper, we consider a modified shifting bottleneck heuristic for complex job...
Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
2007
This paper is motivated by the problem of meeting due dates in a flowshop production...
Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
2005
The quality of an approximate solution for combinatorial optimization problems with a...
Modelling inherent worker differences for workforce planning
2007
Most of the literature in the area of workforce planning assumes that workers are...
Development and analysis of a customer-demand-driven semiconductor supply chain model using the High Level Architecture
2006
Effective supply chain management enables organisations to be more competitive in the...
A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups
2003
Reducing setups in a single machine scheduling problem with sequence dependent setups...
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
2005
This research is motivated by a scheduling problem found in the diffusion and...
Heuristics for minimizing total weighted tardiness in complex job shops
2005
Semi-conductor manufacturing is arguably one of the most complex manufacturing...
Minimizing total weighted tardiness on a single batch process machine with incompatible job families
2005
The diffusion step in semiconductor wafer fabrication is very time consuming, compared...
Quantitative comparison of approximate solution sets for bi-criteria optimization problems
2003
We present the Integrated Preference Functional (IPF) for comparing the quality of...
A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
2002
Increases in the demand for integrated circuits have highlighted the importance of...
Multiple response optimisation using mixture-designed experiments and desirability functions in semiconductor scheduling
2003
Today's highly competitive semiconductor markets place a great emphasis on...
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines
2003
In this paper we propose a two-stage multi-population genetic algorithm (MPGA) to...
D-optimal sequential experiments for generating a simulation-based cycle time–throughput curve
2002
A cycle time–throughput curve quantifies the relationship of average cycle time...
Partition experimental designs for sequential processes: Part II – second-order models
2002
Second-order experimental designs are employed when an experimenter wishes to fit a...
Efficient cycle time-throughput curve generation using a fixed sample size procedure
2001
The cycle time-throughput curve is one of the most important analytical tools used to...
Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
2000
This paper is motivated by the problem of assigning semiconductor fabrication wafer...
Determining the optimal target for a process with multiple markets and variable holding costs
2000
The determination of the quality target for a manufacturing process represents an...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers