首页    期刊浏览 2025年01月06日 星期一
登录注册

文章基本信息

  • 标题:Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
  • 本地全文:下载
  • 作者:Ali Allahverdi ; Tariq Aldowaisan ; Yuri N. Sotskov
  • 期刊名称:International Journal of Mathematics and Mathematical Sciences
  • 印刷版ISSN:0161-1712
  • 电子版ISSN:1687-0425
  • 出版年度:2003
  • 卷号:2003
  • 期号:39
  • 页码:2475-2486
  • DOI:10.1155/S016117120321019X
  • 出版社:Hindawi Publishing Corporation
  • 摘要:

    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.

国家哲学社会科学文献中心版权所有