default search action
Suresh Chand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Suresh Chand, Maqbool Dada, Vinayak Deshpande, Stephen C. Graves
, Ranganath Nuggehalli, Nicholas C. Petruzzi:
In Memoriam: Lee Schwarz, 1941-2023. Manuf. Serv. Oper. Manag. 26(2): 407-408 (2024)
2010 – 2019
- 2019
- [j21]Yanyi Xu, Sang-Phil Kim, Arnab Bisi, Suresh Chand, Maqbool Dada:
Structural properties of the lost sales problem with fractional lead times. Oper. Res. Lett. 47(5): 410-416 (2019) - 2014
- [j20]John B. Norris, Chetan Kumar, Suresh Chand, Herbert Moskowitz, Steve A. Shade, Deanna R. Willis:
An empirical investigation into factors affecting patient cancellations and no-shows at outpatient clinics. Decis. Support Syst. 57: 428-443 (2014) - 2012
- [j19]Mary K. Pilotte, V. Kovaichelvan, Suresh Chand, Ananth V. Iyer:
Global Experiential Projects with a Manufacturer in India: Insights from Five Years of Experience. INFORMS Trans. Educ. 13(1): 31-43 (2012)
2000 – 2009
- 2009
- [j18]Jian Li, Suresh Chand, Maqbool Dada, Shailendra Raj Mehta:
Managing Inventory Over a Short Season: Models with Two Procurement Opportunities. Manuf. Serv. Oper. Manag. 11(1): 174-184 (2009) - 2008
- [j17]Pankaj Kumar, Aparna Misra, Ramil Bhardwaj, M. N. Kamalasanan, S. C. Jain, Suresh Chand, R. P. Tandon:
Synthesis and characterization of some 5-coordinated aluminum-8-hydroxyquinoline derivatives for OLED applications. Displays 29(4): 351-357 (2008) - [j16]Wen-Hua Yang, Suresh Chand:
Learning and forgetting effects on a group scheduling problem. Eur. J. Oper. Res. 187(3): 1033-1044 (2008) - [j15]Sunantha Teyarachakul, Suresh Chand, James Ward:
Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case. Oper. Res. Lett. 36(5): 589-593 (2008) - 2007
- [j14]Sunantha Teyarachakul, Suresh Chand, Jen Tang:
Estimating the limits for statistical process control charts: A direct method improving upon the bootstrap. Eur. J. Oper. Res. 178(2): 472-481 (2007) - 2003
- [j13]Deniz Aksen
The single-item lot-sizing problem with immediate lost sales. Eur. J. Oper. Res. 147(3): 558-566 (2003) - 2002
- [j12]Ishpal Rekhi, Suresh Chand, Herbert Moskowitz:
A Note on optimal allocation of work in stochastic assembly systems. Eur. J. Oper. Res. 137(2): 387-393 (2002) - [j11]Suresh Chand, Vernon Ning Hsu, Suresh P. Sethi:
Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography. Manuf. Serv. Oper. Manag. 4(1): 25-43 (2002) - 2001
- [j10]Suresh Chand, Ting Zeng:
A Comparison of U-Line and Straight-Line Performances Under Stochastic Task Times. Manuf. Serv. Oper. Manag. 3(2): 138-150 (2001) - 2000
- [j9]Suresh Chand, Tim McClurg, Jim Ward:
A model for parallel machine replacement with capacity expansion. Eur. J. Oper. Res. 121(3): 519-531 (2000)
1990 – 1999
- 1999
- [j8]James D. Blocher, Suresh Chand, Kaushik Sengupta:
The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm. Oper. Res. 47(4): 559-569 (1999) - 1997
- [j7]Suresh Chand, Rodney Traub, Reha Uzsoy:
Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Ann. Oper. Res. 70: 115-125 (1997) - 1996
- [j6]Suresh Chand, Rodney Traub, Reha Uzsoy
An iterative heuristic for the single machine dynamic total completion time scheduling problem. Comput. Oper. Res. 23(7): 641-651 (1996) - [j5]Suresh Chand, Herbert Moskowitz, Andreas J. Novak, Ishpal Rekhi, Gerhard Sorger
Capacity Allocation for Dynamic Process Improvement with Quality and Demand Considerations. Oper. Res. 44(6): 964-975 (1996) - 1992
- [j4]Suresh Chand, Dilip Chhajed:
A Single Machine Model for Determination of Optimal Due Dates and Sequence. Oper. Res. 40(3): 596-602 (1992) - 1990
- [j3]Suresh Chand, Suresh P. Sethi:
A Dynamic Lot Sizing Model with Learning in Setups. Oper. Res. 38(4): 644-655 (1990) - [j2]Suresh Chand, Suresh P. Sethi, Jean-Marie Proth:
Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models. Oper. Res. 38(5): 884-892 (1990)
1980 – 1989
- 1981
- [j1]Suresh P. Sethi, Suresh Chand:
Multiple Finite Production Rate Dynamic Lot Size Inventory Models. Oper. Res. 29(5): 931-944 (1981)
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 2024-07-05 21:10 CEST 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: