Jeffrey E. Schaller

21 papers Journal 21
YearRankTypeTitle / Venue / Authors
2022 J jnl
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective.
Comput. Oper. Res.
Andréia F. Silva, Jorge M. S. Valente, Jeffrey E. Schaller
2022 J jnl
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed.
Int. J. Prod. Res.
Jeffrey E. Schaller, Jorge M. S. Valente
2019 J jnl
Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed.
Comput. Oper. Res.
Jeffrey E. Schaller, Jorge M. S. Valente
2019 J jnl
Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed.
Expert Syst. Appl.
Jeffrey E. Schaller, Jorge M. S. Valente
2018 J jnl
Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines.
Comput. Ind. Eng.
Jeffrey E. Schaller, Jorge M. S. Valente
2016 J jnl
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem.
Comput. Oper. Res.
Tomás C. Gonçalves, Jorge M. S. Valente, Jeffrey E. Schaller
2014 J jnl
Minimizing total tardiness for scheduling identical parallel machines with family setups.
Comput. Ind. Eng.
Jeffrey E. Schaller
2013 J jnl
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.
Jeffrey E. Schaller, Jorge M. S. Valente
2012 J jnl
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem.
Comput. Oper. Res.
Jorge M. S. Valente, Jeffrey E. Schaller
2012 J jnl
Minimizing the weighted sum of squared tardiness on a single machine.
Comput. Oper. Res.
Jeffrey E. Schaller, Jorge M. S. Valente
2009 J jnl
Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness.
Eur. J. Oper. Res.
Jeffrey E. Schaller
2008 J jnl
Single machine scheduling with family setups to minimize total earliness and tardiness.
Eur. J. Oper. Res.
Jeffrey E. Schaller, Jatinder N. D. Gupta
2007 J jnl
A comparison of lower bounds for the single-machine early/tardy problem.
Comput. Oper. Res.
Jeffrey E. Schaller
2007 J jnl
Designing and redesigning cellular manufacturing systems to handle demand changes.
Comput. Ind. Eng.
Jeffrey E. Schaller
2006 J jnl
Minimizing flow time in a flow-line manufacturing cell with family setup times.
J. Oper. Res. Soc.
Jatinder N. D. Gupta, Jeffrey E. Schaller
2005 J jnl
Note on minimizing total tardiness in a two-machine flowshop.
Comput. Oper. Res.
Jeffrey E. Schaller
2005 J jnl
Tabu search procedures for the cell formation problem with intra-cell transfer costs as a function of cell size.
Comput. Ind. Eng.
Jeffrey E. Schaller
2004 J jnl
Single machine scheduling with early and quadratic tardy penalties.
Comput. Ind. Eng.
Jeffrey E. Schaller
2002 J jnl
Minimizing the sum of squares lateness on a single machine.
Eur. J. Oper. Res.
Jeffrey E. Schaller
2000 J jnl
Scheduling a flowline manufacturing cell with sequence dependent family setup times.
Eur. J. Oper. Res.
Jeffrey E. Schaller, Jatinder N. D. Gupta, Asoo J. Vakharia
1998 J jnl
A methodology for integrating cell formation and production planning in cellular manufacturing.
Ann. Oper. Res.
Jeffrey E. Schaller, S. Selçuk Erengüç, Asoo J. Vakharia