The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks
During the war, equipment is constantly being damaged with limited battlefield rush-repair time and power. Therefore, some military problems are presented in this paper. In order to get more fighting time for damaged equipment to participate in operation again as much as possible, three problems sho...
Gespeichert in:
| Veröffentlicht in: | Shanghai jiao tong da xue xue bao 2016-12, Vol.21 (6), p.744-749 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 749 |
|---|---|
| container_issue | 6 |
| container_start_page | 744 |
| container_title | Shanghai jiao tong da xue xue bao |
| container_volume | 21 |
| creator | 陈伟龙 陈春良 刘彦 昝翔 刘大可 |
| description | During the war, equipment is constantly being damaged with limited battlefield rush-repair time and power. Therefore, some military problems are presented in this paper. In order to get more fighting time for damaged equipment to participate in operation again as much as possible, three problems should be considered properly. The first problem is how to dynamically choose the most suitable damaged equipment for each repair group. The second one is how to divide tasks between different groups. The third one is how to determine execution sequence in the same group. A mathematical model is established to solve the dynamic battlefield rush- repair task scheduling problem （DBRTSP） in wartime. A variant genetic algorithm is designed to dynamically track the change of the optimal solution. A scheduling example is solved through Matlab. Results show that the proposed model is not only scientific and reasonable, but also convenient and efficient. |
| doi_str_mv | 10.1007/s12204-016-1789-x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1904215421</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>670797880</cqvip_id><sourcerecordid>1880823301</sourcerecordid><originalsourceid>FETCH-LOGICAL-c243x-395c479a8db84590f02777f0a5bcd2a1f33880e44f6b04effd9b8238e3f033563</originalsourceid><addsrcrecordid>eNp9kEtPwzAQhCMEEqXwA7hFcOFiWD8S2wcOUJ5SEVIpZ8tJ7CYlTVq7kdp_j6tUCHHgsNo9fDM7mig6x3CNAfiNx4QAQ4BThLmQaHMQDbCUCRJYiMNwBwhhzMlxdOL9HIABpXIQ3U5LEz9sG72o8vgjL03R1VUzi9_awtRxa-N7vV7XxlamLuJJ50s0MUtduXiq_Zc_jY6srr052-9h9Pn0OB29oPH78-voboxywugGUZnkjEstikywRIIFwjm3oJMsL4jGllIhwDBm0wyYsbaQmSBUGGpDyiSlw-iq9126dtUZv1aLyuemrnVj2s4rLIERnIQJ6OUfdN52rgnpVGgCgi2FHYV7Knet985YtXTVQrutwqB2Xam-UBUKVbtC1SZoSK_xgW1mxv1y_kd0sX9Uts1sFXQ_n1IOXPKQiX4DtZOB9w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1880823301</pqid></control><display><type>article</type><title>The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks</title><source>SpringerNature Journals</source><source>Alma/SFX Local Collection</source><creator>陈伟龙 陈春良 刘彦 昝翔 刘大可</creator><creatorcontrib>陈伟龙 陈春良 刘彦 昝翔 刘大可</creatorcontrib><description>During the war, equipment is constantly being damaged with limited battlefield rush-repair time and power. Therefore, some military problems are presented in this paper. In order to get more fighting time for damaged equipment to participate in operation again as much as possible, three problems should be considered properly. The first problem is how to dynamically choose the most suitable damaged equipment for each repair group. The second one is how to divide tasks between different groups. The third one is how to determine execution sequence in the same group. A mathematical model is established to solve the dynamic battlefield rush- repair task scheduling problem （DBRTSP） in wartime. A variant genetic algorithm is designed to dynamically track the change of the optimal solution. A scheduling example is solved through Matlab. Results show that the proposed model is not only scientific and reasonable, but also convenient and efficient.</description><identifier>ISSN: 1007-1172</identifier><identifier>EISSN: 1995-8188</identifier><identifier>DOI: 10.1007/s12204-016-1789-x</identifier><language>eng</language><publisher>Shanghai: Shanghai Jiaotong University Press</publisher><subject>Architecture ; Computer Science ; Damage ; Dynamics ; Electrical Engineering ; Engineering ; Genetic algorithms ; Life Sciences ; Materials Science ; Mathematical models ; Matlab ; Military ; Production scheduling ; Repair ; Repair & maintenance ; Repair time ; Task scheduling ; Tasks ; Tracking ; War</subject><ispartof>Shanghai jiao tong da xue xue bao, 2016-12, Vol.21 (6), p.744-749</ispartof><rights>Shanghai Jiaotong University and Springer-Verlag Berlin Heidelberg 2016</rights><rights>Copyright Springer Science & Business Media 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c243x-395c479a8db84590f02777f0a5bcd2a1f33880e44f6b04effd9b8238e3f033563</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/85391X/85391X.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s12204-016-1789-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s12204-016-1789-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>陈伟龙 陈春良 刘彦 昝翔 刘大可</creatorcontrib><title>The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks</title><title>Shanghai jiao tong da xue xue bao</title><addtitle>J. Shanghai Jiaotong Univ. (Sci.)</addtitle><addtitle>Journal of Shanghai Jiaotong university</addtitle><description>During the war, equipment is constantly being damaged with limited battlefield rush-repair time and power. Therefore, some military problems are presented in this paper. In order to get more fighting time for damaged equipment to participate in operation again as much as possible, three problems should be considered properly. The first problem is how to dynamically choose the most suitable damaged equipment for each repair group. The second one is how to divide tasks between different groups. The third one is how to determine execution sequence in the same group. A mathematical model is established to solve the dynamic battlefield rush- repair task scheduling problem （DBRTSP） in wartime. A variant genetic algorithm is designed to dynamically track the change of the optimal solution. A scheduling example is solved through Matlab. Results show that the proposed model is not only scientific and reasonable, but also convenient and efficient.</description><subject>Architecture</subject><subject>Computer Science</subject><subject>Damage</subject><subject>Dynamics</subject><subject>Electrical Engineering</subject><subject>Engineering</subject><subject>Genetic algorithms</subject><subject>Life Sciences</subject><subject>Materials Science</subject><subject>Mathematical models</subject><subject>Matlab</subject><subject>Military</subject><subject>Production scheduling</subject><subject>Repair</subject><subject>Repair & maintenance</subject><subject>Repair time</subject><subject>Task scheduling</subject><subject>Tasks</subject><subject>Tracking</subject><subject>War</subject><issn>1007-1172</issn><issn>1995-8188</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp9kEtPwzAQhCMEEqXwA7hFcOFiWD8S2wcOUJ5SEVIpZ8tJ7CYlTVq7kdp_j6tUCHHgsNo9fDM7mig6x3CNAfiNx4QAQ4BThLmQaHMQDbCUCRJYiMNwBwhhzMlxdOL9HIABpXIQ3U5LEz9sG72o8vgjL03R1VUzi9_awtRxa-N7vV7XxlamLuJJ50s0MUtduXiq_Zc_jY6srr052-9h9Pn0OB29oPH78-voboxywugGUZnkjEstikywRIIFwjm3oJMsL4jGllIhwDBm0wyYsbaQmSBUGGpDyiSlw-iq9126dtUZv1aLyuemrnVj2s4rLIERnIQJ6OUfdN52rgnpVGgCgi2FHYV7Knet985YtXTVQrutwqB2Xam-UBUKVbtC1SZoSK_xgW1mxv1y_kd0sX9Uts1sFXQ_n1IOXPKQiX4DtZOB9w</recordid><startdate>20161201</startdate><enddate>20161201</enddate><creator>陈伟龙 陈春良 刘彦 昝翔 刘大可</creator><general>Shanghai Jiaotong University Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>7TB</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20161201</creationdate><title>The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks</title><author>陈伟龙 陈春良 刘彦 昝翔 刘大可</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c243x-395c479a8db84590f02777f0a5bcd2a1f33880e44f6b04effd9b8238e3f033563</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Architecture</topic><topic>Computer Science</topic><topic>Damage</topic><topic>Dynamics</topic><topic>Electrical Engineering</topic><topic>Engineering</topic><topic>Genetic algorithms</topic><topic>Life Sciences</topic><topic>Materials Science</topic><topic>Mathematical models</topic><topic>Matlab</topic><topic>Military</topic><topic>Production scheduling</topic><topic>Repair</topic><topic>Repair & maintenance</topic><topic>Repair time</topic><topic>Task scheduling</topic><topic>Tasks</topic><topic>Tracking</topic><topic>War</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>陈伟龙 陈春良 刘彦 昝翔 刘大可</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Shanghai jiao tong da xue xue bao</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>陈伟龙 陈春良 刘彦 昝翔 刘大可</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks</atitle><jtitle>Shanghai jiao tong da xue xue bao</jtitle><stitle>J. Shanghai Jiaotong Univ. (Sci.)</stitle><addtitle>Journal of Shanghai Jiaotong university</addtitle><date>2016-12-01</date><risdate>2016</risdate><volume>21</volume><issue>6</issue><spage>744</spage><epage>749</epage><pages>744-749</pages><issn>1007-1172</issn><eissn>1995-8188</eissn><abstract>During the war, equipment is constantly being damaged with limited battlefield rush-repair time and power. Therefore, some military problems are presented in this paper. In order to get more fighting time for damaged equipment to participate in operation again as much as possible, three problems should be considered properly. The first problem is how to dynamically choose the most suitable damaged equipment for each repair group. The second one is how to divide tasks between different groups. The third one is how to determine execution sequence in the same group. A mathematical model is established to solve the dynamic battlefield rush- repair task scheduling problem （DBRTSP） in wartime. A variant genetic algorithm is designed to dynamically track the change of the optimal solution. A scheduling example is solved through Matlab. Results show that the proposed model is not only scientific and reasonable, but also convenient and efficient.</abstract><cop>Shanghai</cop><pub>Shanghai Jiaotong University Press</pub><doi>10.1007/s12204-016-1789-x</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1007-1172 |
| ispartof | Shanghai jiao tong da xue xue bao, 2016-12, Vol.21 (6), p.744-749 |
| issn | 1007-1172 1995-8188 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1904215421 |
| source | SpringerNature Journals; Alma/SFX Local Collection |
| subjects | Architecture Computer Science Damage Dynamics Electrical Engineering Engineering Genetic algorithms Life Sciences Materials Science Mathematical models Matlab Military Production scheduling Repair Repair & maintenance Repair time Task scheduling Tasks Tracking War |
| title | The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A37%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Dynamic%20Scheduling%20Model%20of%20Battlefield%20Rush-Repair%20Tasks&rft.jtitle=Shanghai%20jiao%20tong%20da%20xue%20xue%20bao&rft.au=%E9%99%88%E4%BC%9F%E9%BE%99%20%E9%99%88%E6%98%A5%E8%89%AF%20%E5%88%98%E5%BD%A6%20%E6%98%9D%E7%BF%94%20%E5%88%98%E5%A4%A7%E5%8F%AF&rft.date=2016-12-01&rft.volume=21&rft.issue=6&rft.spage=744&rft.epage=749&rft.pages=744-749&rft.issn=1007-1172&rft.eissn=1995-8188&rft_id=info:doi/10.1007/s12204-016-1789-x&rft_dat=%3Cproquest_cross%3E1880823301%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1880823301&rft_id=info:pmid/&rft_cqvip_id=670797880&rfr_iscdi=true |