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

被引：0

作者：

Goto, Hiroyuki ^{[1
]}

机构：

[1] Hosei Univ, Dept Ind & Syst Engn, Koganei, Tokyo 1848584, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2017年 / E100A卷 / 02期

关键词：

max-plus algebra; linear constraint; mixed integer programming; constraint satisfaction problem; scheduling;

D O I：

10.1587/transfun.E100.A.427

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：427 / 430

页数：4