Generating Experimental Data for Computational Testing with Machine Scheduling Applications

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Baker K. R., Martin J. B. An experimental comparision of solution algorithms for the single-machine tardiness problem. Naval Logis. Res. Quart. (1974) 21:187–199Crossref, Google Scholar
• Barr R. S., Golden B. L., Kelly J. P., Resende M. G. C., Stewart W. R. Designing and reporting on computational experiments with heuristic methods. J. Heuristics (1995) 1:9–32Crossref, Google Scholar
• Chandra R. On n/1/F̄ dynamic deterministic problems. Naval Res. Logist. Quart. (1979) 26:537–544Crossref, Google Scholar
• Clark C. E. The PERT model for the distribution of an activity time. Oper. Res. (1962) 10:405–406Link, Google Scholar
• Crowder H. P., Dembo R. S., Mulvey J. M. Reporting computational experiments in mathematical programming. Math. Programming (1978) 15:316–329Crossref, Google Scholar
• Crowder H. P., Saunders P. B. Results of a survey on MP performance indicators. COAL Newsletter (1980) Jan):2–6Google Scholar
• Demeulemeester E., Dodin B., Herroelen W. A random activity network generator. Oper. Res. (1993) 41:972–980Link, Google Scholar
• Demirkol E., Mehta S., Uzsoy R. Benchmarks for shop scheduling problems. Eur. J. Oper. Res. (1998) 109:137–141Crossref, Google Scholar
• Dessouky M. I., Deogun J. S. Sequencing jobs with unequal ready times to minimize mean flow time. SIAM J. Comput. (1981) 10:192–202Crossref, Google Scholar
• Farnum N. R., Stanton L. W. Some results concerning the estimation of beta distribution parameters in PERT. J. Oper. Res. Soc. (1987) 38:287–290Crossref, Google Scholar
• Fisher M. L. Worst case analysis of heuristic algorithms. Management Sci. (1980) 26:1–17Link, Google Scholar
• Fleischer M., Jacobson S. H. Information theory and the finite-time behavior of the simulated annealing algorithm: Experimental results. INFORMS J. Comput. (1999) 11:35–43Link, Google Scholar
• Florian M., Fox B., Crowder H., Dembo R., Mulvey J. Reporting computational experience. Operations Research. Oper. Res. (1979) 27:vii–xGoogle Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Greenberg H. J. Computational testing: Why, how and how much. ORSA J. Comput. (1990) 2:94–97Link, Google Scholar
• Hammer P. L., Shanno D. F. Private communication. (1999) Google Scholar
• Hariri A. M., Potts C. N. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Appl. Math. (1983) 5:99–109Crossref, Google Scholar
• Hariri A. M., Potts C. N. Heuristics for scheduling unrelated parallel machines. Comput. and Oper. Res. (1991) 18:323–331Crossref, Google Scholar
• Hoffman K. L., Jackson R. H. F. In pursuit of a methodology for testing mathematical programming software. Proc. Conf. Evaluating Math. Programming Techniques (1982) Boulder, CO:177–199Crossref, Google Scholar
• Hooker J. N. Needed: An empirical science of algorithms. Oper. Res. (1994) 42:201–212Link, Google Scholar
• Hooker J. N. Testing heuristics: We have it all wrong. J. Heuristics (1995) 1:33–42Crossref, Google Scholar
• Jackson J. R. Scheduling a production line to minimize maximum tardiness. (1955) . Research Report 43 Management Science Research Project, University of California, Los Angeles, CAGoogle Scholar
• Jackson R. H. F., Boggs P. T., Nash S. G., Powell S. Guidelines for reporting results of computational experiments: Report of the ad hoc committee. Math. Programming (1991) 49:413–425Crossref, Google Scholar
• John T. C. Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty. Comput. and Oper. Res. (1989) 16:471–479Crossref, Google Scholar
• Klee V., Minty G. J., Shisha O. How good is the simplex algorithm?. Inequalities III (1972) (Academic Press, New York) 159–175Google Scholar
• Lawler E. L., Lenstra J. K., Rinnoy Kan A. H. G., Shmoys D. B.The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, New York) Google Scholar
• Lee C-Y., Bard J., Pinedo M., Wilhelm W. E. Guidelines for reporting computational results. IIE Transactions. IIE Trans. (1993) 25:121–123Crossref, Google Scholar
• Lenstra J. K., Rinnooy Kan A. H. G., Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. (1977) 1:343–362Crossref, Google Scholar
• Lu L., Posner M. E. An NP-hard open shop scheduling problem with polynomial average time complexity. Math. Oper. Res. (1993) 18:12–38Link, Google Scholar
• McGeoch C. C. Toward an experimental method for algorithm simulation. INFORMS J. Comput. (1996) 8:1–15Link, Google Scholar
• Moore B. A., Reilly C. H. Randomly generating synthetic optimization problems with explicitly induced correlation. (1993) . OSU/ISE Working paper 1993-002, The Ohio State University, Columbus, OHGoogle Scholar
• Ow P. S. Focused scheduling in proportionate flowshops. Management Sci. (1985) 31:852–869Link, Google Scholar
• Ow P. S., Morton T. E. The single machine early/tardy problem. Management Sci. (1989) 35:177–191Link, Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms, and Systems (1995) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Posner M. E. A sequencing problem with release dates and clustered jobs. Management Sci. (1986) 32:731–738Link, Google Scholar
• Potts C. N. A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time. Management Sci. (1985) 31:1300–1311Link, Google Scholar
• Potts C. N., Van Wassenhove L. N. An algorithm for single machine sequencing with deadlines to minimize total weighted completion time. Eur. J. Oper. Res. (1983) 12:379–387Crossref, Google Scholar
• Potts C. N., Van Wassenhove L. N. Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Sci. (1988) 34:843–858Link, Google Scholar
• Srinivasan V. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Res. Logist. Quart. (1971) 18:301–313Crossref, Google Scholar
• Storer R. H., Wu S. D., Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Sci. (1992) 38:1495–1509Link, Google Scholar
• van de Velde S. L. Dual decomposition of a single-machine scheduling problem. Math. Programming (1995) 69:413–428Crossref, Google Scholar
• Weiss H. J., Gershon M. E.Production and Operations Management (1993) 2nd ed.(Allyn and Bacon, Needham Heights, MA) Google Scholar
• Yang J. Scheduling with batch objectives. (1998) . Doctoral dissertation, Industrial and Systems Engineering, The Ohio State University, Columbus, OHGoogle Scholar