Some properties of the flowshop scheduling problem with limited waiting time constraints

被引：0

作者：

Wang, Bai-Lin ^{[1
,2
]}

Li, Tie-Ke ^{[1
,2
]}

机构：

[1] Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China

[2] Engineering Research Center of MES Technology for Iron and Steel Production, Ministry of Education, Beijing 100083, China

来源：

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice | 2012年 / 32卷 / 06期

关键词：

Scheduling;

D O I：

暂无

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A flowshop scheduling problem under the production environment with high temperature and continuity generally meets the limited waiting time constraints, which require the waiting time of any job between consecutive machines is not greater than a given value. Some properties of the flowshop scheduling problem with limited waiting time constraints to minimize the makespan are studied. Based on a deep discussion on the characters of job sequences on machines, the feasibility and validity of problem-solving approaches concerning permutation schedules are analyzed, which provides the theoretical foundation and instruction for algorithm design.

引用

页码：1346 / 1352

共 50 条

[31] Operating room scheduling under waiting time constraints: the Chilean GES plan [J].

Barrera, Javiera ;

Carrasco, Rodrigo A. ;

Mondschein, Susana ;

Canessa, Gianpiero ;

Rojas-Zalazar, David .

ANNALS OF OPERATIONS RESEARCH, 2020, 286 (1-2) :501-527

[32] Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags [J].

Imen Hamdi ;

Taicir Loukil .

Operational Research, 2015, 15 :95-114

[33] Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration [J].

Tang, Lixin ;

Guan, Jing ;

Hu, Guofen .

COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (02) :239-248

[34] Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition [J].

Hamdi, Imen ;

Loukil, Taicir .

2013 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2013, :851-856

[35] Flowshop scheduling problem to minimize total completion time with random and bounded processing times [J].

Sotskov, YN ;

Allahverdi, A ;

Lai, TC .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (03) :277-286

[36] Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags [J].

Hamdi, Imen ;

Loukil, Taicir .

OPERATIONAL RESEARCH, 2015, 15 (01) :95-114

[37] Stochastic two-machine flowshop scheduling problem with total completion time criterion [J].

Soroush, HM ;

Allahverdi, A .

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2005, 12 (02) :159-171

[38] ANALYTIC CHARACTERIZATION OF ADMISSIBLE SCHEDULING SUBJECT TO FLOWSHOP HETEROGENEOUS CONSTRAINTS [J].

BAPTISTE, P ;

CHO, CH ;

FAVREL, J ;

ZOUHRI, M .

RAIRO-AUTOMATIQUE-PRODUCTIQUE INFORMATIQUE INDUSTRIELLE-AUTOMATIC CONTROL PRODUCTION SYSTEMS, 1991, 25 (01) :87-102

[39] Bicriteria in a two-stage flowshop scheduling problem [J].

Bagga, PC ;

Bhambani, A .

INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2000, 31 (11) :1475-1481

[40] SOLVABLE CASES OF THE NO-WAIT FLOWSHOP SCHEDULING PROBLEM [J].

VANDERVEEN, JAA ;

VANDAL, R .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1991, 42 (11) :971-980

← 1 2 3 4 5 →