Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Jay B. Ghosh
Information about the author Jay B. Ghosh will soon be added to the site.
Found
30 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
CON due-date determination and sequencing
1990
We consider a CON due-date problem where the objective is to determine an optimal...
Batch scheduling to minimize the weighted number of tardy jobs
2007
In this paper, we address a single-machine scheduling problem with due dates and batch...
Scheduling with tool changes to minimize total completion time under controllable machining conditions
2007
Scheduling under controllable machining conditions has been studied for some time....
Market- and merit-based adjustment of faculty salaries
2007
We describe an exercise in trying to adjust faculty salaries at a national university...
Maximum diversity/similarity models with extension to part grouping
2005
Maximum diversity/similarity models involve selecting a subset of desired size from a...
Scheduling with tool changes to minimize total completion time: Basic results and shortest processing time performance
2004
We consider a single machine sequencing problem subject to tool wear, where the...
Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
2003
The machine scheduling literature does not consider the issue of tool change. The...
Assigning students to academic majors
2001
We address here the problem of assigning undergraduate students to academic major...
Analysis of Lagrangian lower bounds for a graph partitioning problem
1999
Recently, Ahmadi and Tang demonstrated how various manufacturing problems can be...
Lagrangian solution of maximum dispersion problems
2000
We address the so-called maximum dispersion problems where the objective is to...
Batch scheduling to minimize maximum lateness
1997
We address the single-machine batch scheduling problem which arises when there are job...
Computational aspects of the maximum diversity problem
1996
We address two variations of the maximum diversity problem which arises when m...
Job selection in a heavily loaded shop
1997
Recently, Slotnick and Morton address a job selection problem in a heavily loaded...
Job selection and sequencing on a single machine in a random environment
1993
The authors examine a single machine scheduling problem with random processing times...
Batch scheduling to minimize total completion time
1994
The paper addresses single and multiple machine versions of the batch scheduling...
Siting facilities along a line when equity of service is desirable
1996
The problem where a number of facilities need to be sited along a line is often...
Optimal due-date assignment and sequencing
1992
This paper examines the problem of assigning due-dates to a given set of jobs and...
Solving a generalized model for CON due date assignment and sequencing
1994
This paper considers a generalized model for assigning a constant flow allowance (CON)...
Due-date assignment and early/tardy scheduling on identical parallel machines
1994
This article examines the problem of simultaneously assigning a common due date to a...
Delivery time quotation and order processing with forbidden early shipments
1993
The authors examine the problem of quoting a delivery time to a customer and...
Expectation-variance analysis of job sequences under processing time uncertainty
1992
Uncertainty about job processing times in quite common in scheduling practice....
On the minimization of completion time variance with a bicriteria extension
1992
The authors discuss a single-machine scheduling problem where the objective is to...
On the solution of a stochastic bottleneck assignment problem and its variations
1992
In this article, the authors study the stochastic version of the so-called bottleneck...
Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
1991
In a recent paper, Chen and Bulfin have studied bicriteria scheduling of unit...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers