Thumbnail
Access Restriction
Subscribed

Author Lageweg, B. J. ♦ Lawler, E. L. ♦ Kan, A. H. G. Rinnooy ♦ Lenstra, J. K.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Np-hardness ♦ Combinatorial optimization ♦ Polynomial algorithm
Abstract We describe a computer program that has been used to maintain a record of the known complexity results for a class of 4536 machine scheduling problems. The input of the program consists of a listing of known “easy” problems and a listing of known “hard” problems. The program employs the structure of the problem class to determine the implications of these results. The output provides a listing of essential results in the form of maximal easy and minimal hard problems as well as listings of minimal and maximal open problems, which are helpful in indicating the direction of future research. The application of the program to a restricted class of 120 single-machine problems is demonstrated. Possible refinements and extensions to other research areas are suggested. It is also shown that the problem of determining the minimum number of results needed to resolve the status of all remaining open problems in a complexity classification such as ours is itself a hard problem.
Description Affiliation: Univ. of California, Berkeley (Lawler, E. L.) || Mathematisch Centrum, Amsterdam (Lageweg, B. J.; Lenstra, J. K.) || Erasmus Univ. Rotterdam, The Netherlands (Kan, A. H. G. Rinnooy)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 25
Issue Number 11
Page Count 6
Starting Page 817
Ending Page 822


Open content in new tab

   Open content in new tab
Source: ACM Digital Library