Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem Hans KellererUlrich Pferschy OriginalPaper Pages: 5 - 11
Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints A.A. GladkyY.M. ShafranskyV.A. Strusevich OriginalPaper Pages: 13 - 28
Two Novel Evolutionary Formulations of the Graph Coloring Problem Valmir C. BarbosaCarlos A.G. AssisJosina O. Do Nascimento OriginalPaper Pages: 41 - 63
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems Mhand Hifi OriginalPaper Pages: 65 - 84
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time Bo ChenXiaotie DengWenan Zang OriginalPaper Pages: 85 - 95
