论文标题
切换的最大最小化最小化的最大线性双偶双不平等：工业面包店的案例研究
Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop
论文作者
论文摘要
在本文中，一家工业面包店由切换的最大线性双重不平等现象（SLDIS）建模。 SLDIS是定时的离散事件系统，适用于用时窗口约束描述流式商店，并切换操作模式，其中每种模式对应于工作类型。我们考虑了最小化商店制造商的调度问题，我们表明，基于最大值代数的方法的应用与标准技术相比会导致更快的解决方案。本文的结果是一般的，从某种意义上说，它们可以应用于任何限制限制的置换流店。
In this paper, an industrial bakery shop is modeled by switched max-plus linear-dual inequalities (SLDIs). SLDIs are timed discrete event systems suitable for describing flow shops with time-window constraints and switching operating modes, where each mode corresponds to a job type. We consider the scheduling problem of minimizing the makespan of the shop, and we show that the application of methods based on the max-plus algebra leads to a faster solution compared to standard techniques. The results of the paper are general, in the sense that they can be applied to any permutation flow shop with time-window constraints.
