Search Results - "Ghosh, Jay B."

Minimizing weighted mean absolute deviation of job completion times from their weighted mean by Erel, Erdal, Ghosh, Jay B.

“…We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their…”
Get full text

Customer order scheduling on a single machine with family setup times: Complexity and algorithms by Erel, Erdal, Ghosh, Jay B.

“…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…”
Get full text

FPTAS for half-products minimization with scheduling applications by Erel, Erdal, Ghosh, Jay B.

“…A special class of quadratic pseudo-boolean functions called “half-products” (HP) has recently been introduced. It has been shown that HP minimization, while…”
Get full text

Batch scheduling to minimize the weighted number of tardy jobs by Erel, Erdal, Ghosh, Jay B.

“…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…”
Get full text

Scheduling with tool changes to minimize total completion time under controllable machining conditions by Akturk, M. Selim, Ghosh, Jay B., Kayan, Rabia K.

“…Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun…”
Get full text

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance by Akturk, M.Selim, Ghosh, Jay B., Gunes, Evrim D.

“…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…”
Get full text

Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks by De, Prabuddha, Dunne, E. James, Ghosh, Jay B, Wells, Charles 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…”
Get full text

Job selection in a heavily loaded shop by Ghosh, Jay B.

“…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…”
Get full text

Forming GT cells incrementally using GRASP by Adil, Gajendra K., Ghosh, Jay B.

“…Most research in cell design assumes that the entire plant is converted into group technology cells at once. However, empirical findings in recent papers…”
Get full text

The discrete time-cost tradeoff problem revisited by De, Prabuddha, James Dunne, E., Ghosh, Jay B., Wells, Charles E.

“…In the management of a project, the project duration can often be compressed by accelerating some of its activities at an additional expense. This is the…”
Get full text

ISO 9000 implementation in Turkish industry by Erel, Erdal, Ghosh, Jay B.

“…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…”
Get full text

Assigning students to academic majors by Saber, Hussein M., Ghosh, Jay B.

“…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…”
Get full text

Maximum diversity/similarity models with extension to part grouping by Adil, Gajendra K., Ghosh, Jay B.

“…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…”
Get full text

On the Minimization of Completion Time Variance with a Bicriteria Extension by De, Prabuddha, Ghosh, Jay B, Wells, Charles E

“…We discuss a single-machine scheduling problem where the objective is to minimize the variance of job completion times. To date, the problem has not been…”
Get full text

Lagrangian solution of maximum dispersion problems by Ağca, Şenay, Eksioglu, Burak, Ghosh, Jay B.

“…We address the so‐called maximum dispersion problems where the objective is to maximize the sum or the minimum of interelement distances amongst a subset…”
Get full text

Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem by Adil, Gajendra K, Ghosh, Jay B

“…Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian…”
Get full text

Scheduling to minimize the coefficient of variation by De, Prabuddha, Ghosh, Jay B., Wells, Charles E.

“…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…”
Get full text

Siting Facilities along a Line when Equity of Service is Desirable by Ghosh, Jay B.

“…The problem where a number of facilities need to be sited along a line is often encountered in practice. In this paper, we consider the case where the…”
Get full text

Note--A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date by De, Prabuddha, Ghosh, Jay B, Wells, Charles E

“…This paper points out a conceptual flaw present in a recent publication. It shows how the methodology can be modified to correct this flaw. It also presents…”
Get full text

On the Multiple-machine Extension to a Common Due-date Assignment and Scheduling Problem by De, Prabuddha, Ghosh, Jay B., Wells, Charles E.

“…In a recent paper, Cheng considers the multiple-machine extension to a due-date assignment and scheduling problem. He implicitly assumes zero start times for…”
Get full text