default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJay B. Ghosh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j25]Erdal Erel, Jay B. Ghosh:
Minimizing weighted mean absolute deviation of job completion times from their weighted mean. Appl. Math. Comput. 217(22): 9340-9350 (2011)
2000 – 2009
- 2008
- [j24]Erdal Erel, Jay B. Ghosh:
FPTAS for half-products minimization with scheduling applications. Discret. Appl. Math. 156(15): 3046-3056 (2008) - 2007
- [j23]Erdal Erel, Jay B. Ghosh:
Customer order scheduling on a single machine with family setup times: Complexity and algorithms. Appl. Math. Comput. 185(1): 11-18 (2007) - [j22]P. Sunil Dharmapala, Jay B. Ghosh, Hussein M. Saber:
Market- and Merit-Based Adjustment of faculty Salaries. Asia Pac. J. Oper. Res. 24(1): 1-19 (2007) - [j21]Erdal Erel, Jay B. Ghosh:
Batch scheduling to minimize the weighted number of tardy jobs. Comput. Ind. Eng. 53(3): 394-400 (2007) - [j20]M. Selim Akturk
, Jay B. Ghosh, Rabia K. Kayan:
Scheduling with tool changes to minimize total completion time under controllable machining conditions. Comput. Oper. Res. 34(7): 2130-2146 (2007) - 2005
- [j19]Gajendra Kumar Adil, Jay B. Ghosh:
Maximum diversity/similarity models with extension to part grouping. Int. Trans. Oper. Res. 12(3): 311-323 (2005) - [j18]Erdal Erel, Jay B. Ghosh, J. T. Simon:
New heuristic for the dynamic layout problem. J. Oper. Res. Soc. 56(8): 1001 (2005) - 2004
- [j17]M. Selim Akturk, Jay B. Ghosh, Evrim D. Günes:
Scheduling with tool changes to minimize total completion time: Basic results and SPT performance. Eur. J. Oper. Res. 157(3): 784-790 (2004) - 2003
- [j16]Erdal Erel, Jay B. Ghosh, J. T. Simon:
New heuristic for the dynamic layout problem. J. Oper. Res. Soc. 54(12): 1275-1282 (2003)
1990 – 1999
- 1999
- [j15]Gajendra Kumar Adil, Jay B. Ghosh:
Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem. Oper. Res. 47(5): 785-788 (1999) - 1997
- [j14]Jay B. Ghosh:
Job selection in a heavily loaded shop. Comput. Oper. Res. 24(2): 141-145 (1997) - [j13]Prabuddha De, E. James Dunne, Jay B. Ghosh, Charles E. Wells:
Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks. Oper. Res. 45(2): 302-306 (1997) - [j12]Jay B. Ghosh, Jatinder N. D. Gupta:
Batch scheduling to minimize maximum lateness. Oper. Res. Lett. 21(2): 77-80 (1997) - 1996
- [j11]Jay B. Ghosh:
Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19(4): 175-181 (1996) - 1994
- [j10]Jay B. Ghosh:
Batch scheduling to minimize total completion time. Oper. Res. Lett. 16(5): 271-275 (1994) - 1993
- [j9]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
On the general solution for a class of early/tardy problems. Comput. Oper. Res. 20(2): 141-149 (1993) - [j8]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Delivery time quotation and order processing with forbidden early shipments. Comput. Oper. Res. 20(4): 381-390 (1993) - 1992
- [j7]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
On the Minimization of Completion Time Variance with a Bicriteria Extension. Oper. Res. 40(6): 1148-1155 (1992) - 1991
- [j6]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
On the minimization of the weighted number of tardy jobs with random processing times and deadline. Comput. Oper. Res. 18(5): 457-463 (1991) - [j5]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Scheduling to minimize weighted earliness and tardiness about a common due-date. Comput. Oper. Res. 18(5): 465-475 (1991) - [j4]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine. Comput. Oper. Res. 18(8): 717-720 (1991) - 1990
- [j3]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
Scheduling about a common due date with earliness and tardiness penalties. Comput. Oper. Res. 17(2): 231-241 (1990) - [j2]Prabuddha De, Jay B. Ghosh, Charles E. Wells:
CON due-date determination and sequencing. Comput. Oper. Res. 17(4): 333-342 (1990)
1980 – 1989
- 1988
- [j1]Jay B. Ghosh:
Evaluating multiprocessor performance: an exercise in metamodeling. Simul. 51(2): 70-74 (1988) - 1986
- [c4]Nizar Al-Holou, Jay B. Ghosh, Dana B. Rogers:
Performance evaluation of interconnection networks in multiprocessor systems. ANSS 1986: 179-190 - 1985
- [c3]Jay B. Ghosh:
Asynchronous control of discrete event simulation. ANSS 1985: 255-263 - [c2]Nizar Al-Holou, Jay B. Ghosh, Dana B. Rogers:
General simulation of multiprocessor interconnection networks. WSC 1985: 352-357 - 1984
- [c1]Jay B. Ghosh:
Asynchronous simulation of some discrete time models. WSC 1984: 466-469
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
