Browsing by Subject "Analysis of algorithms"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Batch scheduling to minimize maximum lateness
    (Elsevier, 1997) Ghosh, J. B.; Gupta, J. N. D.
    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, we give an improved dynamic program for the solution of the problem.
  • Thumbnail Image
    ItemOpen Access
    Complexity of the discrete time-cost tradeoff problem for project networks
    (Institute for Operations Research and the Management Sciences (INFORMS), 1997) De, P.; Dunne, E. J.; Ghosh, J. B.; Wells, C. E.
    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 on Decision-CPM. All the algorithms proposed thus far for the solution of the general problem exhibit exponential worst-case complexity, with the notable exception of the pseudo-polynomial dynamic program due to Hindelang and Muth. We first demonstrate that this algorithm is flawed, and that when we correct it, it no longer remains pseudo-polynomial. Continuing on in the main result of the note, we show that this is not at all surprising, since the problem is strongly NP-hard. Finally, we discuss the complexities of various network structures and validate an old conjecture that certain structures are necessarily more difficult to solve.