Browsing by Keywords "Analysis of algorithms"

Now showing items 1-2 of 2

    • Batch scheduling to minimize maximum lateness 

      Ghosh, J. B.; Gupta, J. N. D. (Elsevier, 1997)
      We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, ...

    • Complexity of the discrete time-cost tradeoff problem for project networks 

      De, P.; Dunne, E. J.; Ghosh, J. B.; Wells, C. E. (Institute for Operations Research and the Management Sciences (INFORMS), 1997)
      This note addresses the discrete version of the well-known time-cost tradeoff problem for project networks, which has been studied previously in the standard project management literature as well as in the related literature ...