Maintenance scheduling problems as benchmarks for constraint algorithms

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.26, Iss.1-4, 1999-01, pp. : 149-170

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation algorithms for [TEX equation: k] -partitioning problems with partition matroid constraint

By Li Weidong Li Jianping

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 1093-1099

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms and Methods for Solving Scheduling Problems and Other Extremum Problems on Large-Scale Graphs

By Pankratiev E. Chepovskiy A. Cherepanov E. Chernyshev S.

Journal of Mathematical Sciences, Vol. 128, Iss. 6, 2005-08 ,pp. : 3487-3495

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

By Chudak F.A. Shmoys D.B.

Journal of Algorithms, Vol. 30, Iss. 2, 1999-02 ,pp. : 323-343

Academic Press

Access to resources Recommend Favorite

Approximation Algorithms for Time Constrained Scheduling

By Jansen K. Ohring S.

Information and Computation, Vol. 132, Iss. 2, 1997-02 ,pp. : 85-108

Academic Press

Access to resources Recommend Favorite

Scheduling Optimization of Linear Schedule with Constraint Programming

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Vol. 33, Iss. 2, 2018-02 ,pp. : 124-151

John Wiley & Sons Inc

Access to resources Recommend Favorite