Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
详细信息 查看全文
- 作者：Danial Khorasanian d.khorasanian@in.iut.ac.ir ; Ghasem Moslehi ; moslehi@cc.iut.ac.ir
- 关键词：Blocking flow shop scheduling ; Multi-task flexibility ; Preemption ; Makespan ; Variable neighborhood search
- 刊名：Computers & Operations Research
- 出版年：2017
- 出版时间：March 2017
- 年：2017
- 卷：79
- 期：Complete
- 页码：94-108
- 全文大小：827 K
- 卷排序：79
文摘
F2|block, mtflx, prmp|Cmax with flexibility of the first machine is investigated. It is shown that a dominant schedule can be defined for each sequence. It is proved that the complexity of the problem is strongly NP-hard. Two mathematical models are proposed. A VNS and a new modification of it are developed.