首页|组成于平行机和批处理机的二阶段混合流水作业问题

组成于平行机和批处理机的二阶段混合流水作业问题

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases: (1) b ≥ an, max{m, B} ＜ n;(2) a1 ≤ b ≤ an, m ≤B ＜ n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines.

schedulingfiexiable flowshopidentical machinebatch processorcomplexityapproximation algorithm

何龙敏、孙世杰

展开 >

Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P. R. China

scheduling fiexiable flowshop identical machine batch processor complexity approximation algorithm

Science and Technology Development Fund of Shanghai University

A.10-0101-06-0017

2007

上海大学学报(英文版)
上海大学

上海大学学报(英文版)

影响因子：0.196
ISSN：1007-6417
年,卷(期)：2007.11(1)
  • 27