default search action
Jeffrey E. Schaller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j21]Andréia F. Silva, Jorge M. S. Valente
, Jeffrey E. Schaller:
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective. Comput. Oper. Res. 140: 105691 (2022) - [j20]Jeffrey E. Schaller, Jorge M. S. Valente
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed. Int. J. Prod. Res. 60(18): 5488-5504 (2022)
2010 – 2019
- 2019
- [j19]Jeffrey E. Schaller, Jorge M. S. Valente
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. Comput. Oper. Res. 109: 1-11 (2019) - [j18]Jeffrey E. Schaller, Jorge M. S. Valente
Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed. Expert Syst. Appl. 119: 376-386 (2019) - 2018
- [j17]Jeffrey E. Schaller, Jorge M. S. Valente
Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Comput. Ind. Eng. 119: 146-156 (2018) - 2016
- [j16]Tomás C. Gonçalves, Jorge M. S. Valente
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 70: 115-126 (2016) - 2014
- [j15]Jeffrey E. Schaller:
Minimizing total tardiness for scheduling identical parallel machines with family setups. Comput. Ind. Eng. 72: 274-281 (2014) - 2013
- [j14]Jeffrey E. Schaller, Jorge M. S. Valente
An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness. J. Oper. Res. Soc. 64(6): 805-816 (2013) - 2012
- [j13]Jeffrey E. Schaller, Jorge M. S. Valente
Minimizing the weighted sum of squared tardiness on a single machine. Comput. Oper. Res. 39(5): 919-928 (2012) - [j12]Jorge M. S. Valente
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 39(9): 2223-2231 (2012)
2000 – 2009
- 2009
- [j11]Jeffrey E. Schaller:
Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness. Eur. J. Oper. Res. 197(1): 422-426 (2009) - 2008
- [j10]Jeffrey E. Schaller, Jatinder N. D. Gupta
Single machine scheduling with family setups to minimize total earliness and tardiness. Eur. J. Oper. Res. 187(3): 1050-1068 (2008) - 2007
- [j9]Jeffrey E. Schaller:
Designing and redesigning cellular manufacturing systems to handle demand changes. Comput. Ind. Eng. 53(3): 478-490 (2007) - [j8]Jeffrey E. Schaller:
A comparison of lower bounds for the single-machine early/tardy problem. Comput. Oper. Res. 34(8): 2279-2292 (2007) - 2006
- [j7]Jatinder N. D. Gupta
Minimizing flow time in a flow-line manufacturing cell with family setup times. J. Oper. Res. Soc. 57(2): 163-176 (2006) - 2005
- [j6]Jeffrey E. Schaller:
Tabu search procedures for the cell formation problem with intra-cell transfer costs as a function of cell size. Comput. Ind. Eng. 49(3): 449-462 (2005) - [j5]Jeffrey E. Schaller:
Note on minimizing total tardiness in a two-machine flowshop. Comput. Oper. Res. 32: 3273-3281 (2005) - 2004
- [j4]Jeffrey E. Schaller:
Single machine scheduling with early and quadratic tardy penalties. Comput. Ind. Eng. 46(3): 511-532 (2004) - 2002
- [j3]Jeffrey E. Schaller:
Minimizing the sum of squares lateness on a single machine. Eur. J. Oper. Res. 143(1): 64-79 (2002) - 2000
- [j2]Jeffrey E. Schaller, Jatinder N. D. Gupta
Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur. J. Oper. Res. 125(2): 324-339 (2000)
1990 – 1999
- 1998
- [j1]Jeffrey E. Schaller, S. Selçuk Erengüç, Asoo J. Vakharia:
A methodology for integrating cell formation and production planning in cellular manufacturing. Ann. Oper. Res. 77: 1-21 (1998)
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-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: