default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. M. J. Schutten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Oguzhan Ahmet Arik
, Marco Schutten, Engin Topan:
Weighted earliness/tardiness parallel machine scheduling problem with a common due date. Expert Syst. Appl. 187: 115916 (2022)- 2020
- [j20]Wouter van Heeswijk, Martijn R. K. Mes, J. M. J. Schutten, W. H. M. Zijm:
Evaluating Urban Logistics Schemes Using Agent-based Simulation. Transp. Sci. 54(3): 651-675 (2020)
2010 – 2019
- 2019
- [j19]Wouter J. A. van Heeswijk, Martijn R. K. Mes, J. M. J. Schutten:
The Delivery Dispatching Problem with Time Windows for Urban Consolidation Centers. Transp. Sci. 53(1): 203-221 (2019) - [j18]Wenyi Chen, Martijn Mes, Marco Schutten, Job Quint:
A Ride-Sharing Problem with Meeting Points and Return Restrictions. Transp. Sci. 53(2): 401-426 (2019) - 2016
- [j17]Egbert van der Veen, Johann L. Hurink, J. M. J. Schutten, Suzanne T. Uijland:
A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering. Ann. Oper. Res. 239(1): 189-206 (2016) - [c6]Wouter van Heeswijk, Martijn Mes, Marco Schutten:
An Agent-Based Simulation Framework to Evaluate Urban Logistics Schemes. ICCL 2016: 369-383 - 2015
- [j16]Rob J. I. Basten, M. C. van der Heijden, J. M. J. Schutten, Erhan Kutanoglu:
An approximate approach for the joint problem of level of repair analysis and spare parts stocking. Ann. Oper. Res. 224(1): 121-145 (2015) - [c5]Wouter van Heeswijk, Martijn Mes, Marco Schutten:
An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals. ICCL 2015: 61-75 - 2014
- [c4]Tim van Dijk, Martijn Mes, Marco Schutten, Joaquim A. S. Gromicho:
A unified race algorithm for offline parameter tuning. WSC 2014: 3971-3982 - 2013
- [j15]S. W. A. Haneyah, J. M. J. Schutten, P. C. Schuur, W. H. M. Zijm:
Generic planning and control of automated material handling systems: Practical requirements versus existing theory. Comput. Ind. 64(3): 177-190 (2013) - [j14]S. W. A. Haneyah, P. C. Schuur, J. M. J. Schutten, W. H. M. Zijm:
A generic material flow control model applied in two industrial sectors. Comput. Ind. 64(6): 663-677 (2013) - [c3]S. W. A. Haneyah, J. M. J. Schutten, P. C. Schuur, W. H. M. Zijm:
A Generic Control Architecture for Material Handling Systems Applied to a Baggage Handling System. ICINCO (1) 2013: 121-130 - 2012
- [j13]Joaquim A. S. Gromicho, Jelke J. van Hoorn, A. L. Kok, J. M. J. Schutten:
Restricted dynamic programming: A flexible framework for solving realistic VRPs. Comput. Oper. Res. 39(5): 902-909 (2012) - [j12]A. L. Kok, Erwin W. Hans, J. M. J. Schutten:
Vehicle routing under time-dependent travel times: The impact of congestion avoidance. Comput. Oper. Res. 39(5): 910-918 (2012) - [j11]Rob J. I. Basten, M. C. van der Heijden, J. M. J. Schutten:
Joint optimization of level of repair analysis and spare parts stocks. Eur. J. Oper. Res. 222(3): 474-483 (2012) - 2011
- [j10]Johann L. Hurink, A. L. Kok, Jacob Jan Paulus, J. M. J. Schutten:
Time-constrained project scheduling with adjacent resources. Comput. Oper. Res. 38(1): 310-319 (2011) - [j9]A. L. Kok, Erwin W. Hans, J. M. J. Schutten:
Optimizing departure times in vehicle routes. Eur. J. Oper. Res. 210(3): 579-587 (2011) - [j8]Rob J. I. Basten, M. C. van der Heijden, J. M. J. Schutten:
Practical extensions to a minimum cost flow model for level of repair analysis. Eur. J. Oper. Res. 211(2): 333-342 (2011) - 2010
- [j7]Adrianus Leendert Kok, Christoph Manuel Meyer, Herbert Kopfer, J. M. J. Schutten:
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation. Transp. Sci. 44(4): 442-454 (2010) - [c2]Sameh Haneyah, Johann L. Hurink, Marco Schutten, W. Henk Zijm, Peter Schuur:
Planning and Control of Automated Material Handling Systems: The Merge Module. OR 2010: 281-286
2000 – 2009
- 2009
- [j6]Rob J. I. Basten, J. M. J. Schutten, M. C. van der Heijden:
An efficient model formulation for level of repair analysis. Ann. Oper. Res. 172(1): 119-142 (2009) - [c1]Christoph Manuel Meyer, Herbert Kopfer, Adrianus Leendert Kok, Marco Schutten:
Distributed Decision Making in Combined Vehicle Routing and Break Scheduling. LDIC 2009: 125-133 - 2008
- [j5]T. A. Guldemond, Johann L. Hurink, Jacob Jan Paulus, J. M. J. Schutten:
Time-constrained project scheduling. J. Sched. 11(2): 137-148 (2008) - 2004
- [j4]Mark J. R. Ebben, Matthieu van der Heijden, Johann L. Hurink, Marco Schutten:
Modeling of capacitated transportation systems for integral scheduling. OR Spectr. 26(2): 263-282 (2004)
1990 – 1999
- 1998
- [j3]J. M. J. Schutten:
Practical job shop scheduling. Ann. Oper. Res. 83: 161-178 (1998) - [j2]J. M. J. Schutten:
Decomposition methods for complex factory scheduling problems : Irfan M. Ovacik and Reha Uzsoy Kluwer Academic Publishers, Boston/Dordrech/ London, 1997, Dfl 205.00 / $110.00 / £78.25, x + 215 pages. Eur. J. Oper. Res. 107(1): 243-244 (1998) - 1996
- [j1]J. M. J. Schutten:
List scheduling revisited. Oper. Res. Lett. 18(4): 167-170 (1996)
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:48 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:
