The Flow Shop problem with a server(带服务器的Flow Shop问题)
经典的Flow Shop问题是排序理论中一个得到广泛研究的问题。本文研究的是带服务器的Flow Shop问题。证明了F2,S∥Cmax是强NP-C的,并构造了一个渐近比为2的近似算法。此外,还讨论了它的两种多项式可解的条件。
Main Authors: | , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Zhejiang University Press
2000-07-01
|
Series: | Zhejiang Daxue xuebao. Lixue ban |
Subjects: | |
Online Access: | https://doi.org/zjup/1008-9497.2000.27.4.382-387 |
_version_ | 1827303701457403904 |
---|---|
author | SUChun-jie(苏纯洁) YAOEn-yu(姚恩瑜) |
author_facet | SUChun-jie(苏纯洁) YAOEn-yu(姚恩瑜) |
author_sort | SUChun-jie(苏纯洁) |
collection | DOAJ |
description | 经典的Flow Shop问题是排序理论中一个得到广泛研究的问题。本文研究的是带服务器的Flow Shop问题。证明了F2,S∥Cmax是强NP-C的,并构造了一个渐近比为2的近似算法。此外,还讨论了它的两种多项式可解的条件。 |
first_indexed | 2024-04-24T17:05:26Z |
format | Article |
id | doaj.art-f8a060cace8242e0aa693312f96eb2e0 |
institution | Directory Open Access Journal |
issn | 1008-9497 |
language | zho |
last_indexed | 2024-04-24T17:05:26Z |
publishDate | 2000-07-01 |
publisher | Zhejiang University Press |
record_format | Article |
series | Zhejiang Daxue xuebao. Lixue ban |
spelling | doaj.art-f8a060cace8242e0aa693312f96eb2e02024-03-29T01:58:16ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972000-07-01274382387zjup/1008-9497.2000.27.4.382-387The Flow Shop problem with a server(带服务器的Flow Shop问题)SUChun-jie(苏纯洁)0YAOEn-yu(姚恩瑜)1Department of Mathematics, Zhejiang University, Hangzhou 310027, China(浙江大学数学系,浙江 杭州 310027)Department of Mathematics, Zhejiang University, Hangzhou 310027, China(浙江大学数学系,浙江 杭州 310027)经典的Flow Shop问题是排序理论中一个得到广泛研究的问题。本文研究的是带服务器的Flow Shop问题。证明了F2,S∥Cmax是强NP-C的,并构造了一个渐近比为2的近似算法。此外,还讨论了它的两种多项式可解的条件。https://doi.org/zjup/1008-9497.2000.27.4.382-387复杂性渐近比算法 |
spellingShingle | SUChun-jie(苏纯洁) YAOEn-yu(姚恩瑜) The Flow Shop problem with a server(带服务器的Flow Shop问题) Zhejiang Daxue xuebao. Lixue ban 复杂性 渐近比 算法 |
title | The Flow Shop problem with a server(带服务器的Flow Shop问题) |
title_full | The Flow Shop problem with a server(带服务器的Flow Shop问题) |
title_fullStr | The Flow Shop problem with a server(带服务器的Flow Shop问题) |
title_full_unstemmed | The Flow Shop problem with a server(带服务器的Flow Shop问题) |
title_short | The Flow Shop problem with a server(带服务器的Flow Shop问题) |
title_sort | flow shop problem with a server 带服务器的flow shop问题 |
topic | 复杂性 渐近比 算法 |
url | https://doi.org/zjup/1008-9497.2000.27.4.382-387 |
work_keys_str_mv | AT suchunjiesūchúnjié theflowshopproblemwithaserverdàifúwùqìdeflowshopwèntí AT yaoenyuyáoēnyú theflowshopproblemwithaserverdàifúwùqìdeflowshopwèntí AT suchunjiesūchúnjié flowshopproblemwithaserverdàifúwùqìdeflowshopwèntí AT yaoenyuyáoēnyú flowshopproblemwithaserverdàifúwùqìdeflowshopwèntí |