default search action
Purushothaman Damodaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j13]Maria Hulett, Purushothaman Damodaran, Mahbod Amouie:
Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization. Comput. Ind. Eng. 113: 425-436 (2017) - 2016
- [j12]Nurul Suhaimi, Christine Nguyen, Purushothaman Damodaran:
Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Comput. Ind. Eng. 101: 295-302 (2016) - 2012
- [j11]Purushothaman Damodaran, Maria Hulett:
Analytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processing. Eur. J. Oper. Res. 221(1): 74-86 (2012) - [j10]Purushothaman Damodaran, Mario C. Vélez-Gallego:
A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Expert Syst. Appl. 39(1): 1451-1458 (2012) - 2011
- [j9]Siddharth Mestry, Purushothaman Damodaran, Chin-Sheng Chen:
A branch and price solution approach for order acceptance and capacity planning in make-to-order operations. Eur. J. Oper. Res. 211(3): 480-495 (2011) - [j8]Maria Hulett, Purushothaman Damodaran:
Analytical approximations to predict performance measures of markovian type manufacturing systems with job failures and parallel processing. Eur. J. Oper. Res. 212(1): 89-99 (2011) - [j7]Purushothaman Damodaran, Mario C. Vélez-Gallego, Jairo Maya:
A GRASP approach for makespan minimization on parallel batch processing machines. J. Intell. Manuf. 22(5): 767-777 (2011)
2000 – 2009
- 2009
- [j6]Salil Pradhan, Purushothaman Damodaran:
Performance characterization of complex manufacturing systems with general distributions and job failures. Eur. J. Oper. Res. 197(2): 588-598 (2009) - [j5]Chin-Sheng Chen, Siddharth Mestry, Purushothaman Damodaran, Chao Wang:
The capacity planning problem in make-to-order enterprises. Math. Comput. Model. 50(9-10): 1461-1473 (2009) - 2008
- [j4]Salil Pradhan, Purushothaman Damodaran, Krishnaswami Srihari:
Predicting performance measures for Markovian type of manufacturing systems with product failures. Eur. J. Oper. Res. 184(2): 725-744 (2008) - 2007
- [j3]Wilbert E. Wilhelm, Nilanjan D. Choudhury, Purushothaman Damodaran:
A model to optimize placement operations on dual-head placement machines. Discret. Optim. 4(2): 232-256 (2007) - 2005
- [c1]Pradeep Ramachandaran, Ameya R. Agnihotri, Satoshi Ono, Purushothaman Damodaran, Krishnaswami Srihari, Patrick H. Madden:
Optimal placement by branch-and-price. ASP-DAC 2005: 337-342 - 2004
- [j2]Purushothaman Damodaran, Wilbert E. Wilhelm:
Branch-and-Price Methods for Prescribing Profitable Upgrades of High-Technology Products with Stochastic Demands. Decis. Sci. 35(1): 55-82 (2004) - [j1]Purushothaman Damodaran, Krishnaswami Srihari:
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines. Math. Comput. Model. 40(13): 1465-1472 (2004)
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-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint