Understanding the Relationship between Scheduling Problem Structure and Heuristic Performance using Knowledge Discovery

Using a knowledge discovery approach, we seek insights into the relationships between problem structure and the effectiveness of scheduling heuristics. A large collection of 75,000 instances of the single machine early/tardy scheduling problem is generated, characterized by six features, and used to explore the performance of two common scheduling heuristics. The best heuristic is selected using rules from a decision tree with accuracy exceeding 97%. A self-organizing map is used to visualize the feature space and generate insights into heuristic performance. This paper argues for such a knowledge discovery approach to be applied to other optimization problems, to contribute to automation of algorithm selection as well as insightful algorithm design.

[1]  Yoav Shoham,et al.  Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions , 2002, CP.

[2]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[3]  John R. Rice,et al.  The Algorithm Selection Problem , 1976, Adv. Comput..

[4]  Aiko M. Hormann,et al.  Programs for Machine Learning. Part I , 1962, Inf. Control..

[5]  Horst Samulowitz,et al.  Learning to Solve QBF , 2007, AAAI.

[6]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[7]  Kate Smith-Miles,et al.  On learning algorithm selection for classification , 2006, Appl. Soft Comput..

[8]  Peter Merz,et al.  Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms , 2004, Evolutionary Computation.

[9]  Kenneth R. Baker,et al.  An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .

[10]  Ivana Kruijff-Korbayová,et al.  A Portfolio Approach to Algorithm Selection , 2003, IJCAI.

[11]  Kate A. Smith.  Neural Networks for Prediction and Classification , 2005 .

[12]  Stephen F. Smith,et al.  Combining Multiple Heuristics Online , 2007, AAAI.

[13]  Carlos Soares,et al.  Ranking Learning Algorithms: Using IBL and Meta-Learning on Accuracy and Time Results , 2003, Machine Learning.

[14]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[15]  Manoj K. Malhotra,et al.  Operations Management: Processes and Value Chains , 2004 .

[16]  Ricardo Vilalta,et al.  A Perspective View and Survey of Meta-Learning , 2002, Artificial Intelligence Review.

[17]  David J. Spiegelhalter,et al.  Machine Learning, Neural and Statistical Classification , 2009 .

[18]  Thomas Stützle,et al.  A review of metrics on permutations for search landscape analysis , 2007, Comput. Oper. Res..

[19]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[20]  Kevin Leyton-Brown,et al.  : The Design and Analysis of an Algorithm Portfolio for SAT , 2007, CP.

[21]  Kate Smith-Miles,et al.  Cross-disciplinary perspectives on meta-learning for algorithm selection , 2009, CSUR.

[22]  Teuvo Kohonen,et al.  Self-organized formation of topologically correct feature maps , 2004, Biological Cybernetics.

[23]  David Maxwell Chickering,et al.  A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report) , 2001, Electron. Notes Discret. Math..

[24]  Yoav Shoham,et al.  Understanding Random SAT: Beyond the Clauses-to-Variables Ratio , 2004, CP.

[25]  Thomas Stützle,et al.  New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms , 2004, EvoCOP.

[26]  L. Darrell Whitley,et al.  Algorithm Performance and Problem Structure for Flow-shop Scheduling , 1999, AAAI/IAAI.

[27]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

[28]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

[29]  Michael J. Shaw,et al.  Intelligent Scheduling with Machine Learning Capabilities: The Induction of Scheduling Knowledge§ , 1992 .

[30]  Hilan Bensusan,et al.  Meta-Learning by Landmarking Various Learning Algorithms , 2000, ICML.

[31]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

[32]  David W. Corne,et al.  Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem , 2002, HIS.

[33]  J. Christopher Beck,et al.  APPLYING MACHINE LEARNING TO LOW‐KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS , 2005, Comput. Intell..

[34]  Ross J. W. James,et al.  A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem , 1997 .