Browsing by Author "Ghosh, J. B."

Now showing items 1-15 of 15

    • Analysis of Lagrangian lower bounds for a graph partitioning problem 

      Adil, G. K.; Ghosh, J. B. (Institute for Operations Research and the Management Sciences (INFORMS), 1999)
      Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations ...

    • 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, ...

    • Batch scheduling to minimize the weighted number of tardy jobs 

      Erel, E.; Ghosh, J. B. (Pergamon Press, 2007)
      In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ...

    • 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 ...

    • Computational aspects of the maximum diversity problem 

      Ghosh, J. B. (Elsevier, 1996)
      We address two variations of the maximum diversity problem which arises when m elements are to be selected from an n-element population based on inter-element distances. We study problem complexity and propose randomized ...

    • Customer order scheduling on a single machine with family setup times: complexity and algorithms 

      Erel, E.; Ghosh, J. B. (Elsevier, 2007)
      We consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring ...

    • FPTAS for half-products minimization with scheduling applications 

      Erel, E.; Ghosh, J. B. (Elsevier, 2008)
      A special class of quadratic pseudo-boolean functions called "half-products" (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme ...

    • ISO 9000 implementation in Turkish industry 

      Erel, E.; Ghosh, J. B. (Emerald, 1997)
      Notes that it has become a competitive necessity for firms doing business globally to acquire the ISO 9000 certification, despite the misgivings many have with regard to its true effectiveness. Turkey, an emerging industrial ...

    • Job selection in heavily loaded shop 

      Ghosh, J. B. (Elsevier, 1997)
      Recently, Slotnick and Morton address a job selection problem in a heavily loaded shop, where a tradeoff is sought between the reward obtained when a job is accepted for processing and the lateness penalty incurred when ...

    • Minimizing weighted mean absolute deviation of job completion times from their weighted mean 

      Erel, E.; Ghosh, J. B. (Elsevier, 2011)
      We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the ...

    • New heuristic for the dynamic layout problem 

      Erel, E.; Ghosh, J. B.; Simon, J. T. (Palgrave Macmillan, 2003)
      The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ...

    • Scheduling to minimize the coefficient of variation 

      De, P.; Ghosh, J. B.; Wells, C. E. (Elsevier, 1996)
      In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...

    • Scheduling with tool changes to minimize total completion time under controllable machining conditions 

      Akturk, M. S.; Ghosh, J. B.; Kayan, R. K. (Elsevier, 2007-07)
      Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention. Though machining conditions impact tool ...

    • Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance 

      Aktürk, M. S.; Ghosh, J. B.; Güneş, E. D. (John Wiley & Sons, Inc., 2003)
      The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a ...

    • Scheduling with tool changes to minimize total completion time: basic results and SPT performance 

      Akturk, M. S.; Ghosh, J. B.; Gunes, E. D. (Elsevier, 2004-09-16)
      We consider a single machine sequencing problem subject to tool wear, where the objective is to minimize the total completion time. We briefly describe the problem and discuss its properties, complexity and solution. Mainly, ...