An Algorithm to Minimize Maximum Job Lateness and Flowtime in Two-Machine System

The 24th Southeastern Symposium on and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design System Theory Pub Date : 1992-03-01 DOI:10.1109/SSST.1992.712258

T. Sen, B. N. Borah, O. Foong

引用次数: 0

Abstract

This paper considers the dual criteria of minimizing flowtime and maximum lateness of jobs in the two-machine flowshop system. We discover the conditions that determine which of a pair of adjacent jobs in a sequence should precede the other to minimize either of the two objective functions. We also present a Branch-and-Bound solution procedure to arrive at an optimal solution.

查看原文本刊更多论文

双机系统中最大作业延迟和流程时间最小化算法

本文研究了双机流水车间系统中作业时间最小和作业延迟最大的双重准则。我们发现了决定序列中一对相邻作业中哪一个应该先于另一个以最小化两个目标函数中的任何一个的条件。我们还提出了一个分支定界解的方法来得到最优解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

The 24th Southeastern Symposium on and The 3rd Annual Symposium on Communications, Signal Processing Expert Systems, and ASIC VLSI Design System Theory

自引率

0.00%

发文量