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
相关论文
共 50 条
12345