default search action
Scott E. Grasman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j9]Mike Hewitt, Austin Chacosky, Scott E. Grasman, Barrett W. Thomas:
Integer programming techniques for solving non-linear workforce planning models with learning. Eur. J. Oper. Res. 242(3): 942-950 (2015) - [j8]Angel A. Juan, Markus Rabe, Javier Faulin, Scott E. Grasman:
Guest Editorial. J. Simulation 9(4): 261-262 (2015) - 2014
- [j7]Angel A. Juan, Scott E. Grasman, José Cáceres-Cruz, Tolga Bektas:
A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs. Simul. Model. Pract. Theory 46: 40-52 (2014) - [c5]Guillem Cabrera, Sergio González-Martín, Angel A. Juan, Joan Manuel Marquès, Scott E. Grasman:
Combining biased random sampling with metaheuristics for the facility location problem in distributed computer systems. WSC 2014: 3000-3011 - 2012
- [c4]José Cáceres-Cruz, Angel A. Juan, Tolga Bektas, Scott E. Grasman, Javier Faulin:
Combining Monte Carlo simulation with heuristics for solving the inventory routing problem with stochastic demands. WSC 2012: 274:1-274:9 - 2011
- [p1]Scott E. Grasman, Vicki Callaway, Can Saygin, Wooseung Jang, Henrique Rozenfeld:
Development and Implementation of an Enterprise Learning Architecture for Collaborative Learning. Technology-Enhanced Systems and Tools for Collaborative Learning Scaffolding 2011: 47-67
2000 – 2009
- 2009
- [j6]Scott E. Grasman:
Multiple item capacitated random yield systems. Comput. Ind. Eng. 57(1): 196-200 (2009) - [c3]Angel A. Juan, Scott E. Grasman, Javier Faulin, Daniel Riera, Carlos A. Méndez, Bernardo Ruiz:
Applying Simulation and Reliability to Vehicle Routing Problems with Stochastic Demands. RCRA@AI*IA 2009 - 2008
- [c2]Angel A. Juan, Javier Faulin, Josep Jorba, Scott E. Grasman, Barry B. Barrios:
SR-2: A Hybrid Algorithm for the Capacitated Vehicle Routing Problem. HIS 2008: 78-83 - 2007
- [j5]Shrikant Jarugumilli, Scott E. Grasman:
RFID-enabled inventory routing problems. Int. J. Manuf. Technol. Manag. 10(1): 92-105 (2007) - [j4]Scott E. Grasman, Zaki Sari, Tewfik Sari:
Newsvendor solutions with general random yield distributions. RAIRO Oper. Res. 41(4): 455-464 (2007) - 2006
- [j3]Govind Bajaj, Can Saygin, Scott E. Grasman, Ming C. Leu:
Performance evaluation of an auction-based job allocation model for small- and medium-sized enterprises. Int. J. Netw. Virtual Organisations 3(2): 202-219 (2006) - [c1]Shrikant Jarugumilli, Scott E. Grasman, Sreeram Ramakrishnan:
A simulation framework for real-time management and control of inventory routing decisions. WSC 2006: 1485-1492 - 2005
- [j2]Scott E. Grasman, Tava Lennon Olsen, John R. Birge:
Finite buffer polling models with routing. Eur. J. Oper. Res. 165(3): 794-809 (2005) - [j1]E. Akcora, Scott E. Grasman, Can Saygin:
A job shop scheduling heuristic for varying reward structures. Math. Comput. Model. 42(11-12): 1163-1174 (2005)
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-05-08 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint