A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

被引：5

作者：

Yang, DL ^{[1
]}

Chern, MS

机构：

[1] Nankai Coll Technol & Commerce, Dept Ind Engn & Management, Nantou 54210, Taiwan

[2] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Hsinchu 30043, Taiwan

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 1999年 / 36卷 / 02期

关键词：

flowshop; scheduling; waiting time; NP-hard; 0-1 mixed integer program;

D O I：

10.1016/S0360-8352(99)00137-0

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider a two-machine flowshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0-1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computational experiments are also provided. (C) 1999 Elsevier Science Ltd. All rights reserved.

引用

页码：365 / 378

页数：14

共 7 条

[1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2] CHERN MS, 1995, 18 INT C COMP IND EN
[3] A MICROCOMPUTER BASED SOLUTION TO A PRACTICAL SCHEDULING PROBLEM
HODSON, A
MUHLEMANN, AP
PRICE, DHR
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1985, 36 (10) : 903 - 914
[4] MINIMIZING THE MAKESPAN WITH LATE START PENALTIES ADDED TO PROCESSING TIMES IN A SINGLE FACILITY SCHEDULING PROBLEM
KUNNATHUR, AS
GUPTA, SK
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 47 (01) : 56 - 64
[5] FLOW-SHOP SEQUENCING PROBLEM WITH NO WAIT IN PROCESS
REDDI, SS
RAMAMOORTHY, CV
[J]. OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (03) : 323 - +
[6] SRISKANDARAJAH C, 1989, J OPER RES SOC, V40, P907, DOI 10.2307/2583400
[7] A 2-MACHINE FLOWSHOP SEQUENCING PROBLEM WITH LIMITED WAITING TIME CONSTRAINTS
YANG, DL
CHERN, MS
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 28 (01) : 63 - 70

← 1 →