文章基本信息

标题：Non-permutation flow shop scheduling problem with preemption-dependent processing time
本地全文：下载
作者：Mohsen Ziaee ; Hossein Karimi ; Yibing Li 等
期刊名称：Cogent Engineering
电子版ISSN：2331-1916
出版年度：2016
卷号：3
期号：1
页码：1243982
DOI：10.1080/23311916.2016.1243982
语种：English
出版社：Taylor and Francis Ltd
摘要：Abstract In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested against random instances. The results allow us to identify the effect of some parameters such as coefficient of preemption-dependent processing time, number of preemptions and the selected machine for preemption on the total tardiness.
关键词：preemption ; flow shop ; scheduling