Jeffrey Schaller

857 total citations
32 papers, 698 citations indexed

About

Jeffrey Schaller is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Jeffrey Schaller has authored 32 papers receiving a total of 698 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Industrial and Manufacturing Engineering, 6 papers in Computer Networks and Communications and 5 papers in Management Information Systems. Recurrent topics in Jeffrey Schaller's work include Scheduling and Optimization Algorithms (28 papers), Advanced Manufacturing and Logistics Optimization (24 papers) and Assembly Line Balancing Optimization (23 papers). Jeffrey Schaller is often cited by papers focused on Scheduling and Optimization Algorithms (28 papers), Advanced Manufacturing and Logistics Optimization (24 papers) and Assembly Line Balancing Optimization (23 papers). Jeffrey Schaller collaborates with scholars based in United States and Portugal. Jeffrey Schaller's co-authors include Jorge M. S. Valente, Jatinder N.D. Gupta, Asoo J. Vakharia and Ş. Selçuk Erengüç and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and International Journal of Production Economics.

In The Last Decade

Jeffrey Schaller

32 papers receiving 667 citations

Peers

Jeffrey Schaller
Fan T. Tseng United States
Y.-D. Kim South Korea
Jeffrey Schaller
Citations per year, relative to Jeffrey Schaller Jeffrey Schaller (= 1×) peers Jorge M. S. Valente

Countries citing papers authored by Jeffrey Schaller

Since Specialization
Citations

This map shows the geographic impact of Jeffrey Schaller's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jeffrey Schaller with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeffrey Schaller more than expected).

Fields of papers citing papers by Jeffrey Schaller

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jeffrey Schaller. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jeffrey Schaller. The network helps show where Jeffrey Schaller may publish in the future.

Co-authorship network of co-authors of Jeffrey Schaller

This figure shows the co-authorship network connecting the top 25 collaborators of Jeffrey Schaller. A scholar is included among the top collaborators of Jeffrey Schaller based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jeffrey Schaller. Jeffrey Schaller is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Valente, Jorge M. S., et al.. (2022). Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective. Computers & Operations Research. 140. 105691–105691. 11 indexed citations
2.
Schaller, Jeffrey & Jorge M. S. Valente. (2021). Scheduling in a no-wait flow shop to minimise total earliness and tardiness with additional idle time allowed. International Journal of Production Research. 60(18). 5488–5504. 6 indexed citations
3.
Valente, Jorge M. S., et al.. (2019). Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem. Flexible Services and Manufacturing Journal. 32(3). 487–522. 7 indexed citations
4.
Schaller, Jeffrey & Jorge M. S. Valente. (2019). Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed. Computers & Operations Research. 109. 1–11. 12 indexed citations
5.
Schaller, Jeffrey & Jorge M. S. Valente. (2019). Minimizing total earliness and tardiness in a nowait flow shop. International Journal of Production Economics. 224. 107542–107542. 12 indexed citations
6.
Schaller, Jeffrey & Jorge M. S. Valente. (2018). Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines. Computers & Industrial Engineering. 119. 146–156. 5 indexed citations
7.
Schaller, Jeffrey & Jorge M. S. Valente. (2018). Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed. Expert Systems with Applications. 119. 376–386. 24 indexed citations
8.
Valente, Jorge M. S., et al.. (2016). Metaheuristics for the single machine weighted quadratic tardiness scheduling problem. Computers & Operations Research. 70. 115–126. 9 indexed citations
9.
Schaller, Jeffrey. (2014). Minimizing total tardiness for scheduling identical parallel machines with family setups. Computers & Industrial Engineering. 72. 274–281. 31 indexed citations
10.
Schaller, Jeffrey & Jorge M. S. Valente. (2012). A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness. International Journal of Production Research. 51(3). 772–779. 29 indexed citations
11.
Valente, Jorge M. S. & Jeffrey Schaller. (2011). Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Computers & Operations Research. 39(9). 2223–2231. 18 indexed citations
12.
Schaller, Jeffrey. (2011). Scheduling a permutation flow shop with family setups to minimise total tardiness. International Journal of Production Research. 50(8). 2204–2217. 13 indexed citations
13.
Schaller, Jeffrey & Jorge M. S. Valente. (2011). Minimizing the weighted sum of squared tardiness on a single machine. Computers & Operations Research. 39(5). 919–928. 14 indexed citations
14.
Schaller, Jeffrey. (2008). Incorporating cellular manufacturing into supply chain design. International Journal of Production Research. 46(17). 4925–4945. 15 indexed citations
15.
Schaller, Jeffrey. (2005). An improved branch and bound procedure for scheduling a flow line manufacturing cell. International Journal of Production Research. 43(22). 4697–4720. 5 indexed citations
16.
Schaller, Jeffrey. (2005). Tabu search procedures for the cell formation problem with intra-cell transfer costs as a function of cell size. Computers & Industrial Engineering. 49(3). 449–462. 16 indexed citations
17.
Gupta, Jatinder N.D. & Jeffrey Schaller. (2005). Minimizing flow time in a flow-line manufacturing cell with family setup times. Journal of the Operational Research Society. 57(2). 163–176. 31 indexed citations
18.
Schaller, Jeffrey. (2004). Note on minimizing total tardiness in a two-machine flowshop. Computers & Operations Research. 32(12). 3273–3281. 29 indexed citations
19.
Schaller, Jeffrey. (2000). A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell. International Journal of Production Research. 38(2). 287–308. 25 indexed citations
20.
Schaller, Jeffrey, Jatinder N.D. Gupta, & Asoo J. Vakharia. (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research. 125(2). 324–339. 130 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026