排序方式: 共有12条查询结果,搜索用时 203 毫秒
11.
Improved integer programming models for simple assembly line balancing and related problems
下载免费PDF全文
![点击此处可从《International Transactions in Operational Research》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Marcus Ritt Alysson M. Costa 《International Transactions in Operational Research》2018,25(4):1345-1359
We propose a stronger formulation of the precedence constraints and the station limits for the simple assembly line balancing problem. The linear relaxation of the improved integer program theoretically dominates all previous formulations using impulse variables, and produces solutions of significantly better quality in practice. The improved formulation can be used to strengthen related problems with similar restrictions. We demonstrate their effectiveness on the U‐shaped assembly line balancing problem and on the bin packing problem with precedence constraints. 相似文献
12.
Miguel Correia Alysson Neves Bessani Paulo Veríssimo 《Journal of Parallel and Distributed Computing》2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan. 相似文献