IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v166y2005i1p51-62.html
   My bibliography  Save this article

Core instances for testing: A case study

Author

Listed:
  • Mastrolilli, Monaldo
  • Bianchi, Leonora

Abstract

No abstract is available for this item.

Suggested Citation

  • Mastrolilli, Monaldo & Bianchi, Leonora, 2005. "Core instances for testing: A case study," European Journal of Operational Research, Elsevier, vol. 166(1), pages 51-62, October.
    • Handle: RePEc:eee:ejores:v:166:y:2005:i:1:p:51-62
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00336-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. N. Hooker, 1994. "Needed: An Empirical Science of Algorithms," Operations Research, INFORMS, vol. 42(2), pages 201-212, April.
    2. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    3. Harvey J. Greenberg, 1990. "Computational Testing: Why, How and How Much," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 94-97, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    2. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    3. Mukherjee, Saral & Chatterjee Ashis K, 2002. "Applying Machine Based Decomposition in 2-Machine Flow Shops," IIMA Working Papers WP2002-08-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    4. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    5. Imed Kacem, 2009. "Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 117-133, February.
    6. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    7. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
    8. Sheen, Gwo-Ji & Liao, Lu-Wen, 2007. "A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 181(1), pages 102-116, August.
    9. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1992. "Use of representative operation counts in computational testings of algorithms," Working papers 3459-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    10. Pablo Moscato & Luke Mathieson & Mohammad Nazmul Haque, 2021. "Augmented intuition: a bridge between theory and practice," Journal of Heuristics, Springer, vol. 27(4), pages 497-547, August.
    11. Jinliang Cheng & Hiroshi Kise & Hironori Matsumoto, 1997. "A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 96(3), pages 578-590, February.
    12. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    13. D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2007. "A branch and bound algorithm for scheduling trains in a railway network," European Journal of Operational Research, Elsevier, vol. 183(2), pages 643-657, December.
    14. Nodari Vakhania, 2019. "Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates," Mathematics, MDPI, vol. 7(11), pages 1-42, November.
    15. Baptiste, Philippe & Peridy, Laurent & Pinson, Eric, 2003. "A branch and bound to minimize the number of late jobs on a single machine with release time constraints," European Journal of Operational Research, Elsevier, vol. 144(1), pages 1-11, January.
    16. Felipe Campelo & Elizabeth F. Wanner, 2020. "Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances," Journal of Heuristics, Springer, vol. 26(6), pages 851-883, December.
    17. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
    18. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    19. Chung, Daeyoung & Lee, Kichang & Shin, Kitae & Park, Jinwoo, 2005. "A new approach to job shop scheduling problems with due date constraints considering operation subcontracts," International Journal of Production Economics, Elsevier, vol. 98(2), pages 238-250, November.
    20. Scholl, Armin & Fliedner, Malte & Boysen, Nils, 2010. "Absalom: Balancing assembly lines with assignment restrictions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 688-701, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:166:y:2005:i:1:p:51-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.