Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题)
研究了工件带有拒绝费用的m台同类机在线排序问题，m台机器的速度分别为s1=s2=…=sm-1 =1,sm = s,当工件到达时，可以接收加工，占用一定的加工时间，也可以拒绝，付出相应的罚值.目标是被接收工件的最长完工时间(makespan)与被拒绝工件的总罚值之和最小.对工件2次到达时间问题（零时刻和r时刻各到达一批工件）设计了在线算法H，并证明该算法的竞争比为....
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2016-09-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2016.05.009 |
| _version_ | 1797235760608313344 |
|---|---|
| author | RONGJianhua(荣建华) HOULiying(侯丽英) |
| author_facet | RONGJianhua(荣建华) HOULiying(侯丽英) |
| author_sort | RONGJianhua(荣建华) |
| collection | DOAJ |
| description | 研究了工件带有拒绝费用的m台同类机在线排序问题，m台机器的速度分别为s1=s2=…=sm-1 =1,sm = s,当工件到达时，可以接收加工，占用一定的加工时间，也可以拒绝，付出相应的罚值.目标是被接收工件的最长完工时间(makespan)与被拒绝工件的总罚值之和最小.对工件2次到达时间问题（零时刻和r时刻各到达一批工件）设计了在线算法H，并证明该算法的竞争比为. |
| first_indexed | 2024-04-24T16:53:05Z |
| format | Article |
| id | doaj.art-093e10c0577d441a8662b94dec837402 |
| institution | Directory Open Access Journal |
| issn | 1008-9497 |
| language | zho |
| last_indexed | 2024-04-24T16:53:05Z |
| publishDate | 2016-09-01 |
| publisher | Zhejiang University Press |
| record_format | Article |
| series | Zhejiang Daxue xuebao. Lixue ban |
| spelling | doaj.art-093e10c0577d441a8662b94dec8374022024-03-29T01:58:36ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972016-09-0143554554910.3785/j.issn.1008-9497.2016.05.009Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题)RONGJianhua(荣建华)0https://orcid.org/0000-0002-7147-4866HOULiying(侯丽英)1 1.Department of Basic, Shijiazhuang Tiedao University Sifang College, Shijiazhuang 050000, China( 1.石家庄铁道大学四方学院基础部 河北 石家庄 050000) 2.College of Sciences, Nanjing Agricultural University, Nanjing 210095, China( 2.南京农业大学理学院 江苏 南京 210095)研究了工件带有拒绝费用的m台同类机在线排序问题，m台机器的速度分别为s1=s2=…=sm-1 =1,sm = s,当工件到达时，可以接收加工，占用一定的加工时间，也可以拒绝，付出相应的罚值.目标是被接收工件的最长完工时间(makespan)与被拒绝工件的总罚值之和最小.对工件2次到达时间问题（零时刻和r时刻各到达一批工件）设计了在线算法H，并证明该算法的竞争比为.https://doi.org/10.3785/j.issn.1008-9497.2016.05.009在线排序同类机拒绝费用竞争比 |
| spellingShingle | RONGJianhua(荣建华) HOULiying(侯丽英) Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题) Zhejiang Daxue xuebao. Lixue ban 在线排序 同类机 拒绝费用 竞争比 |
| title | Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题) |
| title_full | Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题) |
| title_fullStr | Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题) |
| title_full_unstemmed | Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题) |
| title_short | Uniform machine scheduling with arrival time and rejection(带有到达时间和拒绝费用工件的同类机排序问题) |
| title_sort | uniform machine scheduling with arrival time and rejection 带有到达时间和拒绝费用工件的同类机排序问题 |
| topic | 在线排序 同类机 拒绝费用 竞争比 |
| url | https://doi.org/10.3785/j.issn.1008-9497.2016.05.009 |
| work_keys_str_mv | AT rongjianhuaróngjiànhuá uniformmachineschedulingwitharrivaltimeandrejectiondàiyǒudàodáshíjiānhéjùjuéfèiyònggōngjiàndetónglèijīpáixùwèntí AT houliyinghóulìyīng uniformmachineschedulingwitharrivaltimeandrejectiondàiyǒudàodáshíjiānhéjùjuéfèiyònggōngjiàndetónglèijīpáixùwèntí |