Jeffrey E. Schaller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jeffrey E. Schaller has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jatinder N. D. Gupta
University of Alabama in Huntsville
9 shared publications - Jorge M. S. Valente
Faculdade de Economia, LIAAD – INESC TEC, Universidade do Porto, Porto, Portugal
2 shared publications Jorge M. S. Valente
Universidade do Porto
1 shared publication- Tomás C. Gonçalves
Faculdade de Economia da Universidade do Porto, C/O Jorge Valente, Rua Dr. Roberto Frias, s/n, 4200-464 Porto, Portugal
1 shared publication
Latest Publications
- 6 October 2026
- Published by Springer Nature
- p. 11-24
Fundamentals of Scheduling Theory
- 6 October 2026
- Published by Springer Nature
- p. 219-230
Summary, Related Problems, and Future Research Directions
- 6 October 2026
- Published by Springer Nature
- p. 219-230
Summary, Related Problems, and Future Research Directions
- 6 October 2026
- Published by Springer Nature
- p. 25-43
The Flowshop Group Scheduling Problem
- 6 October 2026
- Published by Springer Nature
- p. 79-109
Constructive Heuristics to Minimize Makespan
- 6 October 2026
- Published by Springer Nature
- p. 111-146
Local Search and Metaheuristics for Minimizing Makespan
- 6 October 2026
- Published by Springer Nature
- p. 111-146
Local Search and Metaheuristics for Minimizing Makespan
- 6 October 2026
- Published by Springer Nature
- p. 189-215
Total Completion Time Minimization with Carryover Sequence Dependent Setups
- 6 October 2026
- Published by Springer Nature
- p. 189-215
Total Completion Time Minimization with Carryover Sequence Dependent Setups
- 6 October 2026
- Published by Springer Nature
- p. 47-77
Models and Lower Bounds
- 6 October 2026
- Published by Springer Nature
- p. 149-188
Total Completion Time Minimization
- 6 October 2026
- Published by Springer Nature
- p. 3-10
Introduction and Scope
- 30 August 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (18) , 5488-5504
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed
Scheduling jobs in a no-wait flow shop with the objective of minimising total earliness and tardiness is the problem addressed in this paper. Idle time may be needed on the first machine due to the no-wait restriction. A model is developed that shows additional idle can be inserted on the first machine to help reduce earliness. Several dispatching heuristics previously used in other environments were modified and tested. A two-phased procedure was also developed, estimating additional idle in the first phase, and applying dispatching heuristics in the second phase. Several versions of an insertion improvement procedure were also developed. The procedures are tested on instances of various sizes and due date tightness and range. The results show the two-phase heuristics are more effective than the simple rules, and the insertion search improvement procedure can provide considerable improvements.
- 30 August 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (18) , 5488-5504
Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed
Scheduling jobs in a no-wait flow shop with the objective of minimising total earliness and tardiness is the problem addressed in this paper. Idle time may be needed on the first machine due to the no-wait restriction. A model is developed that shows additional idle can be inserted on the first machine to help reduce earliness. Several dispatching heuristics previously used in other environments were modified and tested. A two-phased procedure was also developed, estimating additional idle in the first phase, and applying dispatching heuristics in the second phase. Several versions of an insertion improvement procedure were also developed. The procedures are tested on instances of various sizes and due date tightness and range. The results show the two-phase heuristics are more effective than the simple rules, and the insertion search improvement procedure can provide considerable improvements.