J
John W. Fowler
Researcher at Arizona State University
Publications - 250
Citations - 7550
John W. Fowler is an academic researcher from Arizona State University. The author has contributed to research in topics: Job shop scheduling & Scheduling (production processes). The author has an hindex of 43, co-authored 248 publications receiving 6673 citations. Previous affiliations of John W. Fowler include Dresden University of Technology & University of Sunderland.
Papers
More filters
Journal ArticleDOI
A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations
TL;DR: Typical scheduling problems found in semiconductor manufacturing systems are identified and important solution techniques used to solve these scheduling problems are presented by means of specific examples, and known implementations are reported.
Journal ArticleDOI
How simulation modelling can help reduce the impact of COVID-19
Christine S. M. Currie,John W. Fowler,Kathy Kotiadis,Thomas Monks,Bhakti Stephan Onggo,Duncan A. Robertson,Antuela A. Tako +6 more
TL;DR: Challenges resulting from the COVID-19 pandemic are identified and how simulation modelling could help to support decision-makers in making the most informed decisions are discussed.
Journal ArticleDOI
Grand Challenges in Modeling and Simulation of Complex Manufacturing Systems
John W. Fowler,Oliver Rose +1 more
TL;DR: There is the biggest challenge facing modeling and Simulation analysts today: that of convincing management to sponsor modeling and simulation projects instead of, or in addition to, more commonly used manufacturing system design and improvement methods such as lean manufacturing and six sigma.
Journal ArticleDOI
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines
TL;DR: The MPGA is extended to scheduling problems with three objectives: makespan, TWT, and total weighted completion times (TWC), and also performs better than MOGA.
Journal ArticleDOI
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
TL;DR: This research attempts to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs by developing variations of a time window heuristic based on a decision theory approach for forming and sequencing the batches on a single machine.