Publications

Back to research

Back to homepage

 

Book

Supply Chain Scheduling, Z.-L. Chen and N.G. Hall, 706 pages, February 8, 2022, Springer.

Book cover

Table of Contents

Springer Link

Amazon Link

 

Selected Research Topics and Articles

Topic 1: Supply Chain Scheduling [Unifying the literature of scheduling and supply chain management.]

  • Hall, N.G., Z. Liu. 2016. Capacity allocation games without an initial sequence. Operations Research Letters 44 747-749. Link.
  • Hall, N.G., Z. Liu. 2013. Market good flexibility in capacity auctions. Production and Operations Management 22 459–472. Link.
  • Hall, N.G., Z. Liu. 2011. On auction protocols for decentralized scheduling. Games and Economic Behavior 72 583–585. Link.
  • Hall, N.G., Z. Liu. 2010. Capacity allocation and scheduling in supply chains. Operations Research 58 1711-1725. Link.
  • Chen, Z.-L., N.G. Hall. 2010. The coordination of pricing and scheduling decisions. Manufacturing and Service Operations Management 12 77-92. Link.
  • Chen, Z.-L., N.G. Hall. 2007. Supply chain scheduling: conflict and cooperation in assembly systems. Operations Research 55 1072-1089. Link.
  • Dawande, M., H.N. Geismar, N.G. Hall, C. Sriskandarajah. 2006. Supply chain scheduling: distribution systems. Production and Operations Management 15 243-261. Link.
  • Agnetis, A., N.G. Hall, D. Pacciarelli. 2006. Supply chain scheduling: sequence coordination. Discrete Applied Mathematics 154 2044-2063. Link.
  • Hall, N.G., C.N. Potts. 2005. The coordination of scheduling and batch deliveries. Annals of Operations Research 135 41–64. Link.
  • Hall, N.G., C.N. Potts. 2003. Supply chain scheduling: batching and delivery. Operations Research 51 566-584. Link.

Topic 2: Project Management [Using modern optimization and robust optimization techniques to inform project management decisions.]

  • Shi, Y., N.G. Hall, X. Cui. 2023. Work more tomorrow: resolving present bias in project management. Operations Research 71 314-340. Link.
  • Cai, X., N.G.  Hall, S. Wang, F. Zhang. 2023. Cooperation and contract design in project management with outsourcing. Journal of Systems Science and Systems Engineering 32 34-70. Link.
  • Conejo, A., N.G. Hall, Z. Long, R. Zhang. 2022. Robust capacity planning for project management. INFORMS Journal on Computing 33 1533-1550. Link.
  • She, B., B. Chen, N.G. Hall. 2021. Buffer sizing in critical chain project management by network decomposition. Omega 102 102382. Link.
  • Chen, B., N.G. Hall. 2021. Incentive schemes to resolve Parkinson’s Law in project management. European Journal of Operational Research 288 666–681. Link.
  • Zhao, W., N.G. Hall, Z. Liu. 2020. Optimal project evaluation and selection with task failures. Production and Operations Management 29 428-446. Link.
  • Li, C.-L., N.G. Hall. 2019. Work package sizing and project performance. Operations Research 67 123-142. Link.
  • Hall, N.G. 2016. Research and teaching opportunities in project management. INFORMS Tutorials in Operations Research 329-388. Link.
  • Hall, N.G., Z. Long, J. Qi, M. Sim. 2015. Managing underperformance risk in project portfolio selection. Operations Research 63 660-675. Link.
  • Esenduran, G., N.G. Hall, Z. Liu. 2015. Environmental regulation in project-based industries. Naval Research Logistics 62 228–247. Link.
  • Goh, J., N.G. Hall. 2013. Total cost control in project management via satisficing. Management Science 59 1354-1372. Link.

Topic 3: Empirical Science [Developing a scientific methodology to enhance the experimental rigor of empirical methods.]

  • Hall, N.G., M.E. Posner. 2010. The generation of experimental data for computational testing in optimization. Chapter 4 in Empirical Methods for the Analysis of Optimization Algorithms, ed. T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss, Springer, Berlin, Germany, 73–101. Link.
  • Hall, N.G., M.E. Posner. 2007. Performance prediction and preselection for optimization procedures. Operations Research 55 703-716. Link.
  • Hall, N.G., M.E. Posner. 2001. Generating experimental data for computational testing with machine scheduling applications. Operations Research 49 854-865. Link.

Topic 4: Operations Research and Applications [Using operations research to extend theoretical results and add value in applications.]

  • Lai, M., X. Cai, N.G. Hall. 2022. Cost allocation for less-than-truckload collaboration via shipper consortium. Transportation Science 56 585–611. Link.
  • Chen, Z.-L., N.G. Hall, H. Kellerer. 2017. Dynamic pricing to minimize maximum regret. Production and Operations Management 26 47–63. Link.
  • Vohra, R.V., N.G. Hall. 1993. Probabilistic analysis of the maximal covering location problem. Discrete Applied Mathematics 43 175–183. Link.
  • Hall, N.G., R.V. Vohra. 1993. Towards equitable distribution via proportional equity constraints. Mathematical Programming 58 287–294. Link.
  • Hall, N.G., D.S. Hochbaum. 1992. The multicovering problem. European Journal of Operational Research 62 323–339. Link.
  • Hall, N.G., J.C. Hershey, L.G. Kessler, R.C. Stotts. 1992. A model for making project funding decisions at The National Cancer Institute. Operations Research 40 1040–1052. Link.
  • Hall, N.G., D.S. Hochbaum. 1986. A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics 15 35–40. Link.

Topic 5: Rescheduling [Developing algorithms to adjust a planned schedule in the event of a disruption.]

  • Hall, N.G., C.N. Potts. 2010. Rescheduling for job unavailability. Operations Research 58 746–755. Link.
  • Hall, N.G., Z. Liu, C.N. Potts. 2007. Rescheduling for multiple new orders. INFORMS Journal on Computing 19 633–645. Link.
  • Hall, N.G., C.N. Potts. 2004. Rescheduling for new orders. Operations Research 52 440–453. Link.

Topic 6: Scheduling with Finite Capacity Buffers [Developing algorithms for scheduling in environments with limited capacity for entering or finished work.]

  • Hall, N.G., M.E. Posner, C.N. Potts. 1998. Scheduling with finite capacity input buffers. Operations Research 46 S154–S159. Link.
  • Hall, N.G., M.E. Posner, C.N. Potts. 1998. Scheduling with finite capacity output buffers. Operations Research 46 S84–S97. Link.
  • Hall, N.G., M.E. Posner, C.N. Potts. 1997. Preemptive scheduling with finite capacity input buffers. Annals of Operations Research 70 399–413. Link.

Topic 7: Scheduling with Servers [Developing algorithms to coordinate scheduling decisions with the operation of material handling devices.]

  • Hall, N.G., T. Ganesharajah, C. Sriskandarajah. 2001. Operational decisions in AGV-served flowshop loops: scheduling. Annals of Operations Research 107 161–188. Link.
  • Hall, N.G., C.N. Potts, C. Sriskandarajah. 2000. Parallel machine scheduling with a common server. Discrete Applied Mathematics 102 223–243. Link.
  • Kamoun, H., N.G. Hall, C. Sriskandarajah. 1999. Scheduling in robotic cells: heuristics and cell design. Operations Research 47 821–835. Link.
  • Hall, N.G. 1999. Operations research techniques for robotic system planning, design, control and analysis. Chapter 30 in Handbook of Industrial Robotics, vol. II, ed. S.Y. Nof, John Wiley, New York, 543–577. Link.
  • Hall, N.G., H. Kamoun, C. Sriskandarajah. 1998. Scheduling in robotic cells: complexity and steady-state analysis. European Journal of Operational Research 109 43–65. Link.
  • Ganesharajah, T., N.G. Hall, C. Sriskandarajah. 1998. Design and operational issues in AGV-served manufacturing systems. Annals of Operations Research 76 109–154. Link.
  • Sriskandarajah, C., N.G. Hall, H. Kamoun. 1998. Scheduling large robotic cells without buffers. Annals of Operations Research 76 287–321. Link.
  • Hall, N.G., H. Kamoun, C. Sriskandarajah. 1997. Scheduling in robotic cells: classification, two and three machine cells. Operations Research 45 421–439. Link.

Topic 8: Completion Time Variance [Developing methods to control the variance of job completion times.]

  • Hall, N.G., W. Kubiak. 1991. Proof of a conjecture of Schrage about the completion time variance problem. Operations Research Letters 10 (1991) 467–472. Link.
  • Hall, N.G., M.E. Posner. 1991. Earliness-Tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Operations Research 39 836–846. Link.
  • Hall, N.G., W. Kubiak, S.P. Sethi. 1991. Earliness-Tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Operations Research 39 847–856. Link.
  • Hall, N.G. 1986. Single and multiple processor models for minimizing completion time variance. Naval Research Logistics Quarterly 33 49–54. Link.

Topic 9: Extensions of Classical Scheduling [Extending, unifying, and applying results from the classical scheduling literature.]

  • Hall, N.G., Z. Liu. 2023. Scheduling with present bias. Production and Operations Management 32 1743-1759. Link.
  • Hall, N.G., Z. Liu. 2022. Choosing opponents in tournaments. INFORMS Tutorials in Operations Research 93-115. Link.
  • Xu, S., N.G. Hall. 2021. Fatigue, scheduling and operations: review and research opportunities. European Journal of Operational Research 295 807–822. Link.
  • Hall, N.G., M.E. Posner, C.N. Potts. 2018. Online production planning to maximize the number of on-time orders. Annals of Operations Research 298 249-269. Link.
  • Hall, N.G., J.Y.-T. Leung, C.-L. Li. 2016. Multitasking via alternate and shared processing: algorithms and complexity. Discrete Applied Mathematics 208 41–58. Link.
  • Hall, N.G., J.Y.-T. Leung, C.-L. Li. 2015. The effects of multitasking on operations scheduling. Production and Operations Management 24 1248–1265. Link.
  • Hall, N.G., C.N. Potts. 2012. A proposal for redesign of the FedEx Cup playoff series on The PGA Tour. Interfaces 42 166–179. Link.
  • Hall, N.G., M.E. Posner, C.N. Potts. 2009. Online scheduling with known arrival times. Mathematics of Operations Research 34 92–102. Link.
  • Hall, N.G., Z. Liu. 2008. Cooperative and noncooperative games for capacity planning and scheduling. INFORMS Tutorials in Operations Research 108–129. Link.
  • Chen, Z.-L., N.G. Hall. 2008 Maximum profit scheduling. Manufacturing & Service Operations Management 10 84–107. Link.
  • Hall, N.G., M.E. Posner. 2004. Sensitivity analysis for scheduling problems. Journal of Scheduling 7 49–83. Link.
  • Hall, N.G., G. Laporte, E. Selvarajah, C. Sriskandarajah. 2003. Scheduling and lot streaming in flowshops with no-wait in process. Journal of Scheduling 6 339–354. Link.
  • Hall, N.G., T.-E. Lee, M.E. Posner. 2002. The complexity of cyclic shop scheduling problems. Journal of Scheduling 5 307–327. Link.
  • Hall, N.G., ‘M. Lesaoana, C.N. Potts. 2001. Scheduling with fixed delivery dates. Operations Research 49 134–144. Link.
  • Abadi, I.N.K., N.G. Hall, C. Sriskandarajah. 2000. Minimizing cycle time in a blocking flowshop. Operations Research 48 177–180. Link.
  • Hall, N.G., W.-P. Liu, J.B. Sidney. 1998. Scheduling in broadcast networks. Networks 32 233–253. Link.
  • Julien, F.M., M.J. Magazine, N.G. Hall. 1997. Generalized preemption models for single machine dynamic scheduling problems. IIE Transactions 29 359–372. Link
  • Hall, N.G., C. Sriskandarajah. 1996. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 510–525. Link.
  • Hall, N.G., S.P. Sethi, C. Sriskandarajah. 1991. On the complexity of generalized due date scheduling problems. European Journal of Operational Research 51 100–109. Link.

 

Back to research

Back to homepage