Shop scheduling problems with pliable jobs
Shop scheduling problems with pliable jobs
复制标题
柔性作业的车间调度问题
DOI:
10.1007/s10951-019-00607-9
复制
发表时间:
2019
影响因子:
2
通讯作者:
Knust S
中科院分区:
文献类型:
--
作者:
Knust S
In this paper, we study a new type of flow shop and open shop models, which handle so-called “pliable” jobs: their total processing times are given, but individual processing times of operations which make up these jobs are flexible and need to be determined. Our analysis demonstrates that many versions of flow shop and open shop problems with pliable jobs appear to be computationally easier than their traditional counterparts, unless the jobs have job-dependent restrictions imposed on minimum and maximum operation lengths. In the latter case, most problems with pliability become NP-hard even in the case of two machines.
登录
查看更多内容
影响因子:
9.2
作者:
Rouie Anuar;Y. Bukchin
通讯作者:
Rouie Anuar;Y. Bukchin
DOI:
10.1016/j.ejor.2018.04.024
发表时间:
2018-11
期刊:
Eur. J. Oper. Res.
影响因子:
--
作者:
Matthias Bultmann;S. Knust;S. Waldherr
通讯作者:
Matthias Bultmann;S. Knust;S. Waldherr
DOI:
10.1007/3-540-56891-3_37
发表时间:
1993
期刊:
--
影响因子:
--
作者:
K. Ecker;Reiner Hirschberg
通讯作者:
Reiner Hirschberg
影响因子:
2.7
作者:
Matthias Bultmann;S. Knust;S. Waldherr
通讯作者:
Matthias Bultmann;S. Knust;S. Waldherr
DOI:
--
发表时间:
1982
期刊:
影响因子:
--
作者:
N. Hefetz;I. Adiri
通讯作者:
I. Adiri