TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN OR TOTAL COMPLETION TIME WITH RANDOM AND BOUNDED SETUP TIMES

IF 1 Q1 MATHEMATICS

INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES Pub Date : 2003-01-01 DOI:10.1155/S016117120321019X

A. Allahverdi, Tariq A. Aldowaisan, Y. Sotskov

引用次数: 37

Abstract

This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given.

查看原文本刊更多论文

在随机和有界设置时间下最小化完工时间或总完成时间的双机流水车间调度问题

本文研究了具有单独设置时间的双机流水车间调度问题，以最小化完工时间或总完成时间(TCT)。设置时间被放宽为随机变量，而不是像OR文献中常用的那样是确定性的。此外，在只给出下界和上界的情况下使用无分布的设置时间。建立了所考虑的流车间的全局和局部优势关系，并给出了一个说明性的数值算例。

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

求助全文

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

来源期刊

INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES Mathematics-Mathematics (miscellaneous)

CiteScore

2.30

自引率

8.30%

发文量

审稿时长

17 weeks

期刊介绍： The International Journal of Mathematics and Mathematical Sciences is a refereed math journal devoted to publication of original research articles, research notes, and review articles, with emphasis on contributions to unsolved problems and open questions in mathematics and mathematical sciences. All areas listed on the cover of Mathematical Reviews, such as pure and applied mathematics, mathematical physics, theoretical mechanics, probability and mathematical statistics, and theoretical biology, are included within the scope of the International Journal of Mathematics and Mathematical Sciences.