James D. Blocher
Affiliations: | Indiana University, Bloomington, Bloomington, IN, United States |
Area:
Management Business Administration, Industrial Engineering, Operations ResearchGoogle:
"James Blocher"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Hu X, Blocher JD, Heese HS, et al. (2016) Scheduling products with subassemblies and changeover time Journal of the Operational Research Society. 67: 1025-1033 |
Blocher JD, Sevastyanov S. (2015) A note on the Coffman---Sethi bound for LPT scheduling Journal of Scheduling. 18: 325-327 |
Zhou F, Blocher JD, Hu X, et al. (2014) Optimal single machine scheduling of products with components and changeover cost European Journal of Operational Research. 233: 75-83 |
Anderson BE, Blocher JD, Bretthauer KM, et al. (2013) An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines Mathematical and Computer Modelling. 57: 483-493 |
Blocher JD, Garrett RW, Schmenner RW. (2009) Throughput Time Reduction: Taking One'S Medicine Production and Operations Management. 8: 357-373 |
Blocher JD, Chhajed D. (2008) Minimizing customer order lead-time in a two-stage assembly supply chain Annals of Operations Research. 161: 25-52 |
Blocher JD, Chand S, Sengupta K. (1999) The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm Operations Research. 47: 559-569 |
Blocher JD, Chhajed D, Leung M. (1998) Customer order scheduling in a general job shop environment Decision Sciences. 29: 951-977 |
Blocher JD, Chand S. (1996) An Improved Lower Bound for the Changeover Scheduling Problem Iie Transactions. 28: 901-909 |
Blocher JD, Chand S. (1996) A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem European Journal of Operational Research. 91: 456-470 |