Two-machine flowshop scheduling in a physical examination center

被引:2
|
作者
Wang, Yadong [1 ]
Fan, Baoqiang [1 ]
Zhai, Jingang [1 ]
Xiong, Wei [2 ]
机构
[1] Ludong Univ, Dept Math & Stat Sci, Yantai 264025, Shandong, Peoples R China
[2] Binzhou Med Univ, Yantai Affiliated Hosp, Dept Spinal Surg, Yantai 264025, Shandong, Peoples R China
关键词
Physical examination; Scheduling; Flowshop; Complexity; Algorithm; SEQUENCING SUBJECT; MAKESPAN;
D O I
10.1007/s10878-017-0233-y
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we formulate two important operational processes of the physical examination center as a group scheduling problem in two-machine flowshop. The objective is to minimize the makespan. We first analyze the complexity of the problem with a fixed number of release dates and present a pseudo-polynomial-time algorithm. Then we provide an approximation algorithm and analyze its worst-case error bounds for the problem with two release dates and an optimal algorithm for a very practical special case of the problem.
引用
收藏
页码:363 / 374
页数:12
相关论文
共 50 条