James D. Blocher

633 total citations
18 papers, 497 citations indexed

About

James D. Blocher is a scholar working on Industrial and Manufacturing Engineering, Management Information Systems and Computer Networks and Communications. According to data from OpenAlex, James D. Blocher has authored 18 papers receiving a total of 497 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Industrial and Manufacturing Engineering, 6 papers in Management Information Systems and 4 papers in Computer Networks and Communications. Recurrent topics in James D. Blocher's work include Scheduling and Optimization Algorithms (13 papers), Advanced Manufacturing and Logistics Optimization (7 papers) and Supply Chain and Inventory Management (6 papers). James D. Blocher is often cited by papers focused on Scheduling and Optimization Algorithms (13 papers), Advanced Manufacturing and Logistics Optimization (7 papers) and Supply Chain and Inventory Management (6 papers). James D. Blocher collaborates with scholars based in United States, Russia and Germany. James D. Blocher's co-authors include Sayan Chatterjee, Dilip Chhajed, M.A. Venkataramanan, Kurt M. Bretthauer, Elliot Bendoly, Shanker Krishnan, Srinagesh Gavirneni, Suresh Chand, Mark T. Leung and Roger W. Schmenner and has published in prestigious journals such as Academy of Management Journal, European Journal of Operational Research and Operations Research.

In The Last Decade

James D. Blocher

18 papers receiving 456 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
James D. Blocher United States	11	181	159	112	103	101	18	497
George C. Hadjinicola Cyprus	11	62 0.3×	121 0.8×	45 0.4×	143 1.4×	88 0.9×	18	397
Michael D. Oliff United States	9	140 0.8×	129 0.8×	31 0.3×	109 1.1×	178 1.8×	15	435
Niels Feldmann Germany	6	98 0.5×	45 0.3×	23 0.2×	199 1.9×	116 1.1×	11	375
Sandip Rakshit India	9	73 0.4×	39 0.2×	25 0.2×	77 0.7×	165 1.6×	21	437
Ryan Sougstad United States	7	76 0.4×	19 0.1×	50 0.4×	196 1.9×	148 1.5×	9	452
Claudio Lamprecht Switzerland	3	117 0.6×	74 0.5×	42 0.4×	57 0.6×	131 1.3×	5	311
Bharat Bhushan India	7	72 0.4×	51 0.3×	22 0.2×	108 1.0×	146 1.4×	16	333
Yongqiang Li China	10	105 0.6×	37 0.2×	79 0.7×	15 0.1×	50 0.5×	32	309
Magnus Berglund Sweden	5	47 0.3×	57 0.4×	95 0.8×	386 3.7×	183 1.8×	5	507
Amir M. Hormozi United States	10	35 0.2×	44 0.3×	65 0.6×	123 1.2×	102 1.0×	13	322

Countries citing papers authored by James D. Blocher

Since Specialization

Citations

This map shows the geographic impact of James D. Blocher'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 James D. Blocher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites James D. Blocher more than expected).

Fields of papers citing papers by James D. Blocher

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by James D. Blocher. 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 James D. Blocher. The network helps show where James D. Blocher may publish in the future.

Co-authorship network of co-authors of James D. Blocher

This figure shows the co-authorship network connecting the top 25 collaborators of James D. Blocher. A scholar is included among the top collaborators of James D. Blocher 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 James D. Blocher. James D. Blocher is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

Hu, Xinxin, James D. Blocher, H. Sebastian Heese, & Feng Zhou. (2016). Scheduling products with subassemblies and changeover time. Journal of the Operational Research Society. 67(8). 1025–1033. 1 indexed citations

Blocher, James D., et al.. (2015). A note on the Coffman–Sethi bound for LPT scheduling. Journal of Scheduling. 18(3). 325–327. 7 indexed citations

Zhou, Feng C., James D. Blocher, Xinxin Hu, & H. Sebastian Heese. (2013). Optimal single machine scheduling of products with components and changeover cost. European Journal of Operational Research. 233(1). 75–83. 4 indexed citations

Blocher, James D., et al.. (2012). An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines. Mathematical and Computer Modelling. 57(3-4). 483–493. 15 indexed citations

Blocher, James D., et al.. (2008). Value of Sharing Production Yield Information in a Serial Supply Chain. Production and Operations Management. 17(6). 614–625. 50 indexed citations

Blocher, James D. & Dilip Chhajed. (2007). Minimizing customer order lead-time in a two-stage assembly supply chain. Annals of Operations Research. 161(1). 25–52. 15 indexed citations

Bendoly, Elliot, James D. Blocher, Kurt M. Bretthauer, Shanker Krishnan, & M.A. Venkataramanan. (2005). Online/In-Store Integration and Customer Retention. Journal of Service Research. 7(4). 313–327. 175 indexed citations

Blocher, James D., Suresh Chand, & Kaushik Sengupta. (1999). The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm. Operations Research. 47(4). 559–569. 8 indexed citations

Blocher, James D., et al.. (1999). THROUGHPUT TIME REDUCTION: TAKING ONE'S MEDICINE. Production and Operations Management. 8(4). 357–373. 15 indexed citations

10.

Blocher, James D., Dilip Chhajed, & Mark T. Leung. (1998). Customer Order Scheduling in a General Job Shop Environment*. Decision Sciences. 29(4). 951–981. 35 indexed citations

11.

Blocher, James D. & Suresh Chand. (1996). An Improved Lower Bound for the Changeover Scheduling Problem. IIE Transactions. 28(11). 901–909. 2 indexed citations

12.

Blocher, James D. & Dilip Chhajed. (1996). The customer order lead-time problem on parallel machines. Naval Research Logistics (NRL). 43(5). 629–654. 41 indexed citations

13.

Blocher, James D. & Dilip Chhajed. (1996). The customer order lead‐time problem on parallel machines. Naval Research Logistics (NRL). 43(5). 629–654. 1 indexed citations

14.

Blocher, James D. & Suresh Chand. (1996). A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. European Journal of Operational Research. 91(3). 456–470. 13 indexed citations

15.

Chatterjee, Sayan & James D. Blocher. (1992). Measurement of Firm Diversification: Is It Robust?. Academy of Management Journal. 35(4). 874–888. 13 indexed citations

16.

Chatterjee, Sayan & James D. Blocher. (1992). MEASUREMENT OF FIRM DIVERSIFICATION: IS IT ROBUST?. Academy of Management Journal. 35(4). 874–888. 87 indexed citations

17.

Blocher, James D.. (1992). Single machine changeover scheduling. Purdue e-Pubs (Purdue University System). 3 indexed citations

18.

Blocher, James D. & Suresh Chand. (1991). Scheduling of parallel processors: A posterior bound on LPT sequencing and a two-step algorithm. Naval Research Logistics (NRL). 38(2). 273–287. 12 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