| A hybrid two-stage fexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately |
| |
| 作者姓名： | 何龙敏 孙世杰 |
| |
| 作者单位： | Department of Mathematics College of Sciences Shanghai University，Department of Mathematics College of Sciences，Shanghai University，Shanghai 200444，P.R.China，Shanghai 200444，P.R.China |
| |
| 基金项目： | Project supported by the Science and Technology Development Fund of Shanghai University(Grant No.A.10-0101-06-0017) |
| |
| 摘 要： | 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 prob- lem is NP-hard in general.We divide it into eight subcases.Except for the following two subcases:(1)b≥a_n,max{m,B}＜n; (2)a_1≤b≤a_n,m≤B≤n,for all other subcases,their NP-hardness was proved or pointed out,corresponding approxima- tion algorithms were conducted and their worst-case performances were estimated.In aU these approximation algorithms,the Multifit and PTAS algorithms were respectively used,as the jobs were scheduled in m identical parallel machines.
|
A hybrid two-stage fexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately |
| |
| HE Long-min SUN Shi-jie.A hybrid two-stage fexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately[J].Journal of Shanghai University(English Edition),2007(1). |
| |
| Authors: | HE Long-min SUN Shi-jie |
| |
| Institution: | HE Long-min SUN Shi-jie Department of Mathematics,College of Sciences,Shanghai University,Shanghai 200444,P.R.China |
| |
| Abstract: | |
| |
| Keywords: | scheduling flexiable flowshop identical machine batch processor complexity approximation algorithm |
| 本文献已被 CNKI 等数据库收录！ |
