Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Jay B. Ghosh"'
Autor:
Erdal Erel, Jay B. Ghosh
Publikováno v:
Computers and Industrial Engineering
Cataloged from PDF version of article. 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-polynomia
Publikováno v:
Computers and Operations Research
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 wear and induce tool change,
Autor:
Jay B. Ghosh, Erdal Erel
Publikováno v:
Applied Mathematics and Computation
Cataloged from PDF version of article. 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 seque
Publikováno v:
Asia-Pacific Journal of Operational Research. 24(01):1-19
We describe an exercise in trying to adjust faculty salaries at a national university in the Arabian Gulf region in order to attract and retain quality faculty. The problem is strongly constrained by policy and budget considerations and leads to two
Autor:
Jay B. Ghosh, Gajendra Kumar Adil
Publikováno v:
International Transactions in Operational Research. 12:311-323
Maximum diversity/similarity models involve selecting a subset of desired size from a given pool of objects such that some measure of diversity or similarity among the selected objects is maximized. Such models have found application, among other pla
Publikováno v:
European Journal of Operational Research
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, however, we focus on the
Publikováno v:
Journal of the Operational Research Society
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 total of the flow and the rel
Publikováno v:
Naval Research Logistics
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 tool change is caused most freq
Autor:
Hussein M. Saber, Jay B. Ghosh
Publikováno v:
Omega. 29:513-523
We address here the problem of assigning undergraduate students to academic major areas at a Middle-Eastern business school, which is quite different from what one usually faces in the West. Our formulation considers the student's preference in the l
Publikováno v:
Naval Research Logistics. 47:97-114
We address the so-called maximum dispersion problems where the objective is to maximize thesumor theminimumof interelement distances amongst a subset chosen from a given set. The problems arise in a variety of contexts including the location of obnox