A methodology for integrating cell formation and production planning in cellular manufacturing. - Jeffrey E. Schaller; S. Selçuk Erengüç; Asoo J. Vakharia (Ann. Oper. Res., 1998)

Scheduling a flowline manufacturing cell with sequence dependent family setup times. - Jeffrey E. Schaller; Jatinder N. D. Gupta; Asoo J. Vakharia (Eur. J. Oper. Res., 2000)

Minimizing the sum of squares lateness on a single machine. - Jeffrey E. Schaller (Eur. J. Oper. Res., 2002)

Single machine scheduling with early and quadratic tardy penalties. - Jeffrey E. Schaller (Comput. Ind. Eng., 2004)

Tabu search procedures for the cell formation problem with intra-cell transfer costs as a function of cell size. - Jeffrey E. Schaller (Comput. Ind. Eng., 2005)

Note on minimizing total tardiness in a two-machine flowshop. - Jeffrey E. Schaller (Comput. Oper. Res., 2005)

Minimizing flow time in a flow-line manufacturing cell with family setup times. - Jatinder N. D. Gupta; Jeffrey E. Schaller (J. Oper. Res. Soc., 2006)

Designing and redesigning cellular manufacturing systems to handle demand changes. - Jeffrey E. Schaller (Comput. Ind. Eng., 2007)

A comparison of lower bounds for the single-machine early/tardy problem. - Jeffrey E. Schaller (Comput. Oper. Res., 2007)

Single machine scheduling with family setups to minimize total earliness and tardiness. - Jeffrey E. Schaller; Jatinder N. D. Gupta (Eur. J. Oper. Res., 2008)

Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness. - Jeffrey E. Schaller (Eur. J. Oper. Res., 2009)

Minimizing the weighted sum of squared tardiness on a single machine. - Jeffrey E. Schaller; Jorge M. S. Valente (Comput. Oper. Res., 2012)

Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. - Jorge M. S. Valente; Jeffrey E. Schaller (Comput. Oper. Res., 2012)

An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness. - Jeffrey E. Schaller; Jorge M. S. Valente (J. Oper. Res. Soc., 2013)

Minimizing total tardiness for scheduling identical parallel machines with family setups. - Jeffrey E. Schaller (Comput. Ind. Eng., 2014)

Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. - Tomás C. Gonçalves; Jorge M. S. Valente; Jeffrey E. Schaller (Comput. Oper. Res., 2016)

Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. - Jeffrey E. Schaller; Jorge M. S. Valente (Comput. Ind. Eng., 2018)

Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. - Jeffrey E. Schaller; Jorge M. S. Valente (Comput. Oper. Res., 2019)

Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed. - Jeffrey E. Schaller; Jorge M. S. Valente (Expert Syst. Appl., 2019)

Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective. - Andréia F. Silva; Jorge M. S. Valente; Jeffrey E. Schaller (Comput. Oper. Res., 2022)

Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed. - Jeffrey E. Schaller; Jorge M. S. Valente (Int. J. Prod. Res., 2022)