Jeffrey E. Schaller

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 6

Top Topics

Parallel Machines

Top Venues

Comput. Oper. Res.

Comput. Ind. Eng.

Int. J. Prod. Res.

J. Oper. Res. Soc.

Publications

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) (2022)
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 (2022)
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 (2019)
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 (2019)
Jeffrey E. Schaller, Jorge M. S. Valente
Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Comput. Ind. Eng. 119 (2018)
Tomás C. Gonçalves, Jorge M. S. Valente, Jeffrey E. Schaller
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 70 (2016)
Jeffrey E. Schaller
Minimizing total tardiness for scheduling identical parallel machines with family setups. Comput. Ind. Eng. 72 (2014)
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) (2013)
Jeffrey E. Schaller, Jorge M. S. Valente
Minimizing the weighted sum of squared tardiness on a single machine. Comput. Oper. Res. 39 (5) (2012)
Jorge M. S. Valente, Jeffrey E. Schaller
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Comput. Oper. Res. 39 (9) (2012)
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) (2009)
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) (2008)
Jeffrey E. Schaller
A comparison of lower bounds for the single-machine early/tardy problem. Comput. Oper. Res. 34 (8) (2007)
Jeffrey E. Schaller
Designing and redesigning cellular manufacturing systems to handle demand changes. Comput. Ind. Eng. 53 (3) (2007)
Jatinder N. D. Gupta, Jeffrey E. Schaller
Minimizing flow time in a flow-line manufacturing cell with family setup times. J. Oper. Res. Soc. 57 (2) (2006)
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) (2005)
Jeffrey E. Schaller
Note on minimizing total tardiness in a two-machine flowshop. Comput. Oper. Res. 32 (2005)
Jeffrey E. Schaller
Single machine scheduling with early and quadratic tardy penalties. Comput. Ind. Eng. 46 (3) (2004)
Jeffrey E. Schaller
Minimizing the sum of squares lateness on a single machine. Eur. J. Oper. Res. 143 (1) (2002)
Jeffrey E. Schaller, Jatinder N. D. Gupta, Asoo J. Vakharia
Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur. J. Oper. Res. 125 (2) (2000)
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 (1998)