Reduction of Max-Plus Algebraic Equations to Constraint Satisfaction Problems for Mixed Integer Programming

Abstract

This letter presents a method for solving several linear equations in max-plus algebra. The essential part of these equations is reduced to constraint satisfaction problems compatible with mixed integer programming. This method is flexible, compared with optimization methods, and suitable for scheduling of certain discrete event systems.