default search action
Michele E. Pfund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
- [b1]Douglas C. Montgomery, Cheryl L. Jennings, Michele E. Pfund:
Managing, Controlling, and Improving Quality. Wiley 2010, ISBN 978-0-471-69791-6, pp. I-XII, 1-501
Journal Articles
- 2017
- [j9]Michele E. Pfund, John W. Fowler:
Extending the boundaries between scheduling and dispatching: hedging and rescheduling techniques. Int. J. Prod. Res. 55(11): 3294-3307 (2017) - 2014
- [j8]Yang-Kuei Lin, Michele E. Pfund, John W. Fowler:
Processing time generation schemes for parallel machine scheduling problems with various correlation structures. J. Sched. 17(6): 569-586 (2014) - 2013
- [j7]Yang-Kuei Lin, John W. Fowler, Michele E. Pfund:
Multiple-objective heuristics for scheduling unrelated parallel machines. Eur. J. Oper. Res. 227(2): 239-253 (2013) - 2011
- [j6]Yang-Kuei Lin, Michele E. Pfund, John W. Fowler:
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Comput. Oper. Res. 38(6): 901-916 (2011) - 2009
- [j5]Hari Balasubramanian, John W. Fowler, Ahmet B. Keha, Michele E. Pfund:
Scheduling interfering job sets on parallel machines. Eur. J. Oper. Res. 199(1): 55-67 (2009) - 2008
- [j4]Michele E. Pfund, John W. Fowler, Amit Gadkari, Yan Chen:
Scheduling jobs on parallel machines with setup times and ready times. Comput. Ind. Eng. 54(4): 764-782 (2008) - [j3]Michele E. Pfund, Hari Balasubramanian, John W. Fowler, Scott J. Mason, Oliver Rose:
A multi-criteria approach for scheduling semiconductor wafer fabrication facilities. J. Sched. 11(1): 29-47 (2008) - 2007
- [j2]Rajesh Swaminathan, Michele E. Pfund, John W. Fowler, Scott J. Mason, Ahmet B. Keha:
Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Comput. Oper. Res. 34(10): 3055-3068 (2007) - 2005
- [j1]Lars Mönch, Hari Balasubramanian, John W. Fowler, Michele E. Pfund:
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput. Oper. Res. 32: 2731-2750 (2005)
Conference and Workshop Papers
- 2009
- [c4]Yang-Kuei Lin, Michele E. Pfund, John W. Fowler:
Minimizing makespans for unrelated parallel machine scheduling problems. SOLI 2009: 107-110 - 2007
- [c3]Scott J. Mason, Mary E. Kurz, Michele E. Pfund, John W. Fowler, Letitia M. Pohl:
Multi-Objective Semiconductor Manufacturing Scheduling: A Random Keys Implementation of NSGA-II. CISched 2007: 159-164 - 2002
- [c2]Lars Mönch, Hari Balasubramanian, John W. Fowler, Michele E. Pfund:
Minimizing Total Weighted Tardiness on Parallel Batch Process Machines Using Genetic Algorithms. OR 2002: 229-234 - [c1]Juergen Potoradi, Ong Siong Boon, Scott J. Mason, John W. Fowler, Michele E. Pfund:
Semiconductor manufacturing: using simulation-based scheduling to maximize demand fulfillment in a semiconductor assembly facility. WSC 2002: 1857-1861
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint