Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

被引：18

作者：

Carpov, Sergiu ^{[1
,2
]}

Carlier, Jacques ^{[2
]}

Nace, Dritan ^{[2
]}

Sirdey, Renaud ^{[1
]}

机构：

[1] CEA, LIST, Embedded Real Time Syst Lab, F-91191 Gif Sur Yvette, France

[2] Univ Technol Compiegne, UMR CNRS Heudiasyc 6599, Ctr Rech Royallieu, F-60205 Compiegne, France

来源：

COMPUTERS & OPERATIONS RESEARCH | 2012年 / 39卷 / 03期

关键词：

Hybrid flow shop; Precedence relations; Randomized list scheduling; Multiprocessor scheduling; SCHEDULING PROBLEMS; STAGE;

D O I：

10.1016/j.cor.2011.05.020

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This study deals with the two-stage hybrid flow shop (HFS) problem with precedence constraints. Two versions are examined, the classical HFS where idle time between the operations of the same job is allowed and the no-wait HFS where idle time is not permitted. For solving these problems an adaptive randomized list scheduling heuristic is proposed. Two global bounds are also introduced so as to conservatively estimate the distance to optimality of the proposed heuristic. The evaluation is done on a set of randomly generated instances. The heuristic solutions for the classical HFS in average are provably situated below 2% from the optimal ones, and on the other hand, in the case of the no-wait HFS the average deviation is below 5%. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：736 / 745

页数：10

共 50 条

[31] An approximation scheme for heterogeneous parallel task scheduling in a two-stage hybrid flow shop
School of Information Science and Engineering, Northeastern University, Shengyang
110004, China
J. Inf. Sci. Eng., 4 (1291-1308):
[32] An Approximation Scheme for Heterogeneous Parallel Task Scheduling in a Two-Stage Hybrid Flow Shop
Sun, Jinghao
Meng, Yakun
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2015, 31 (04) : 1291 - 1308
[33] A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
Yang, Jaehwan
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (05) : 1531 - 1538
[34] A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
School of Business Administration, University of Seoul, Seoul, Korea, Republic of
Int J Prod Res, 5 (1531-1538):
[35] Algorithms for two-stage hybrid flow shop in MapReduce systems
Wei Q.
Wu Y.
Jiang Y.
Zhao Y.
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2020, 40 (05): : 1255 - 1265
[36] Analysis of a Heuristics for Scheduling Two-Stage Hybrid Flow Shop
Xie, Xie
Tang, Lixin
INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 879 - 882
[37] Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
DONG Jianming
HU Jueliang
CHEN Yong
AppliedMathematics:AJournalofChineseUniversities(SeriesB), 2013, 28 (03) : 358 - 368
[38] Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
Jian-ming Dong
Jue-liang Hu
Yong Chen
Applied Mathematics-A Journal of Chinese Universities, 2013, 28 : 358 - 368
[39] Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
Dong Jian-ming
Hu Jue-liang
Chen Yong
APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2013, 28 (03) : 358 - 368
[40] Two-stage flexible flow-shop scheduling problem with m identical parallel machines on one stage and a batch processor on the other stage
Dept. of Mathematics, Shanghai University, Shanghai 200444, China
J. Harbin Inst. Technol., 2008, 5 (674-678):

← 1 2 3 4 5 →