IDEAS home Printed from https://ideas.repec.org/e/pur45.html
   My authors  Follow this author

Thijs Urlings

Personal Details

First Name:Thijs
Middle Name:
Last Name:Urlings
Suffix:
RePEc Short-ID:pur45
The above email address does not seem to be valid anymore. Please ask Thijs Urlings to update the entry or send us the correct address. Thank you.
http://www.tudelft.nl/thurlings

Affiliation

Faculteit Techniek, Bestuur en Management
Technische Universiteit Delft

Delft, Netherlands
http://www.tbm.tudelft.nl/

: +31-(0)15-2787100

Postbus 5015, 2600 GA Delft
RePEc:edi:tbtudnl (more details at EDIRC)

Research output

as
Jump to: Articles

Articles

  1. Veeneman, Wijnand & Wilschut, Janneke & Urlings, Thijs & Blank, Jos & van de Velde, Didier, 2014. "Efficient frontier analysis of Dutch public transport tendering: A first analysis," Research in Transportation Economics, Elsevier, vol. 48(C), pages 101-108.
  2. Urlings, Thijs & Ruiz, Rubén & Stützle, Thomas, 2010. "Shifting representation search for hybrid flexible flowline problems," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1086-1095, December.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Articles

  1. Urlings, Thijs & Ruiz, Rubén & Stützle, Thomas, 2010. "Shifting representation search for hybrid flexible flowline problems," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1086-1095, December.

    Cited by:

    1. García-Martínez, C. & Rodriguez, F.J. & Lozano, M., 2014. "Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 454-463.
    2. Huerta-Muñoz, Diana L. & Ríos-Mercado, Roger Z. & Ruiz, Rubén, 2017. "An iterated greedy heuristic for a market segmentation problem with multiple attributes," European Journal of Operational Research, Elsevier, vol. 261(1), pages 75-87.
    3. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    4. Lozano, M. & Molina, D. & GarcI´a-MartI´nez, C., 2011. "Iterated greedy for the maximum diversity problem," European Journal of Operational Research, Elsevier, vol. 214(1), pages 31-38, October.
    5. Vallada, Eva & Ruiz, Rubén & Framinan, Jose M., 2015. "New hard benchmark for flowshop scheduling problems minimising makespan," European Journal of Operational Research, Elsevier, vol. 240(3), pages 666-677.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Thijs Urlings should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.