The Dominance Flow Shop Scheduling Problem

Q2 Mathematics Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.004

Daniel A. Rossit , Óscar C. Vásquez , Fernando Tohmé , Mariano Frutos , Martín D. Safe

引用次数: 7

Abstract

We introduce a new line of analysis of Flow Shop scheduling problems, for the case of two jobs and assuming that processing times are unknown. The goal is to determine the domination relations between permutation and non-permutation schedules. We analyze the structural and dominance properties that ensue in this setting, based on the critical paths of schedules.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

优势流车间调度问题

我们引入了一种新的分析流程车间调度问题的方法，在两个作业的情况下，假设加工时间未知。目标是确定置换调度和非置换调度之间的支配关系。基于时间表的关键路径，我们分析了在这种情况下随之而来的结构和支配属性。

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

求助全文

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

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Minimal condition for shortest vectors in lattices of low dimension Enumerating words with forbidden factors Polygon-circle and word-representable graphs On an arithmetic triangle of numbers arising from inverses of analytic functions