一类加工需要额外资源的平行机调度问题的算法设计

O226; 给出了一类加工需要额外资源的平行机调度问题的精确算法.针对在平行机上加工的工件,除需要机器资源外,还需要一个单位额外资源的问题,考虑额外资源的种类和数量有限,以给出问题的最优调度使工件的完工时间最小为目标.该问题源于地球观测卫星的数据下载,在智能制造和信息处理等领域亦有广泛应用.给出了该问题的整数规划模型、最优解下界和分支定界算法;给出了一种有效的分支策略以避免重复分支,设计了相应的定界方法以提高算法的收敛速度.通过小规模实例和大量的数值仿真实验,验证了算法的正确性和在不同参数配置下的有效性....

Full description

Saved in:
Bibliographic Details
Published in:浙江大学学报（理学版） Vol. 51; no. 3; pp. 321 - 335
Main Authors: 江明月, 简苏平, 崔晓龙, 万龙, 董建明
Format: Journal Article
Language:Chinese
Published: 浙江理工大学 计算机科学与技术学院(人工智能学院),浙江 杭州 310018%江西财经大学 信息管理学院,江西 南昌 330032%浙江工商大学 管理工程与电子商务学院,浙江 杭州 310018 01.03.2024
Subjects:
additional resources
parallel machine scheduling problem
平行机调度问题
额外资源
branch and bound algorithm
integer programming model
整数规划模型
分支定界算法
ISSN:1008-9497
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract O226; 给出了一类加工需要额外资源的平行机调度问题的精确算法.针对在平行机上加工的工件,除需要机器资源外,还需要一个单位额外资源的问题,考虑额外资源的种类和数量有限,以给出问题的最优调度使工件的完工时间最小为目标.该问题源于地球观测卫星的数据下载,在智能制造和信息处理等领域亦有广泛应用.给出了该问题的整数规划模型、最优解下界和分支定界算法;给出了一种有效的分支策略以避免重复分支,设计了相应的定界方法以提高算法的收敛速度.通过小规模实例和大量的数值仿真实验,验证了算法的正确性和在不同参数配置下的有效性.
AbstractList O226; 给出了一类加工需要额外资源的平行机调度问题的精确算法.针对在平行机上加工的工件,除需要机器资源外,还需要一个单位额外资源的问题,考虑额外资源的种类和数量有限,以给出问题的最优调度使工件的完工时间最小为目标.该问题源于地球观测卫星的数据下载,在智能制造和信息处理等领域亦有广泛应用.给出了该问题的整数规划模型、最优解下界和分支定界算法;给出了一种有效的分支策略以避免重复分支,设计了相应的定界方法以提高算法的收敛速度.通过小规模实例和大量的数值仿真实验,验证了算法的正确性和在不同参数配置下的有效性.
Abstract_FL An exact algorithm is presented for a parallel machine scheduling problem with additional resources constraints.Specifically,the jobs need be processed on parallel machines,and the processing of each job requires a unit of some additional resources in addition to machine resource.The variety and amount of additional resources are limited,our goal is to make the optimal schedule of the problem so that the completion time of the final completed job is minimized.This problem originates from the field of earth observation satellite data download,and has been widely used in intelligent manufacturing and information processing.The integer programming model,the lower bound of the optimal solution and the branch and bound algorithm of the problem are given.An effective branching strategy is proposed to avoid repeated branching and a bound method is designed to improve the convergence rate of the algorithm.The correctness and the effectiveness of the algorithm under different parameter configuration are verified by a large number of numerical simulation experiments and a small-sized instance example.
Author 崔晓龙
万龙
江明月
简苏平
董建明
AuthorAffiliation 浙江理工大学 计算机科学与技术学院(人工智能学院),浙江 杭州 310018%江西财经大学 信息管理学院,江西 南昌 330032%浙江工商大学 管理工程与电子商务学院,浙江 杭州 310018
AuthorAffiliation_xml – name: 浙江理工大学 计算机科学与技术学院(人工智能学院),浙江 杭州 310018%江西财经大学 信息管理学院,江西 南昌 330032%浙江工商大学 管理工程与电子商务学院,浙江 杭州 310018
Author_FL JIANG Mingyue
DONG Jianming
CUI Xiaolong
WAN Long
JIAN Suping
Author_FL_xml – sequence: 1
  fullname: JIANG Mingyue
– sequence: 2
  fullname: JIAN Suping
– sequence: 3
  fullname: CUI Xiaolong
– sequence: 4
  fullname: WAN Long
– sequence: 5
  fullname: DONG Jianming
Author_xml – sequence: 1
  fullname: 江明月
– sequence: 2
  fullname: 简苏平
– sequence: 3
  fullname: 崔晓龙
– sequence: 4
  fullname: 万龙
– sequence: 5
  fullname: 董建明
BookMark eNo9jz1Lw0Ach2-oYK39FoJTzv_dJc3dKKW-QMFF53J5kwZJwUMsThU7iYOLVqSCLdoxKEXUCH4ak1y-hRHF6QfP8Ht4llAl6kU-QisEMLO5tRbirlIRJgDcEKawMQVqYmAYCFRQ9Z8vorpSXQdKbBEqeBW1vt4G-fNHen6fvj4W44GenRbTu_ThWr8Ms-Qyvx2m73M9ucjGiX46S5NZMYqL6U3J83iUza90_KnjyTJaCOSB8ut_W0N7G63d5pbR3tncbq63DUWAguELSXxqO55jUyoZ0AYR3BOBtKgFrmW5buCC6Xq0wT2fSMoYSC4dIghhdsA9VkOrv7_HMgpktN8Je0eHUWnsnIRev-_8ZAMr69g3Fndqag
ClassificationCodes O226
ContentType Journal Article
Copyright Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID 2B.
4A8
92I
93N
PSX
TCJ
DOI 10.3785/j.issn.1008-9497.2024.03.010
DatabaseName Wanfang Data Journals - Hong Kong
WANFANG Data Centre
Wanfang Data Journals
万方数据期刊 - 香港版
China Online Journals (COJ)
China Online Journals (COJ)
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
DocumentTitle_FL Algorithm design of the parallel machine scheduling problem with additional resource constraints
EndPage 335
ExternalDocumentID zjdxxb202403010
GrantInformation_xml – fundername: (国家自然科学基金); (国家自然科学基金)
  funderid: (国家自然科学基金); (国家自然科学基金)
GroupedDBID 2B.
4A8
92I
93N
ALMA_UNASSIGNED_HOLDINGS
GROUPED_DOAJ
PSX
TCJ
ID FETCH-LOGICAL-s1020-e9a1e27bdb722a3026198d9fa5250c55ccfc04cd268de1a2330a8ab191137f8d3
ISSN 1008-9497
IngestDate Thu May 29 04:06:15 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords additional resources
parallel machine scheduling problem
平行机调度问题
额外资源
branch and bound algorithm
integer programming model
整数规划模型
分支定界算法
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1020-e9a1e27bdb722a3026198d9fa5250c55ccfc04cd268de1a2330a8ab191137f8d3
PageCount 15
ParticipantIDs wanfang_journals_zjdxxb202403010
PublicationCentury 2000
PublicationDate 2024-03-01
PublicationDateYYYYMMDD 2024-03-01
PublicationDate_xml – month: 03
  year: 2024
  text: 2024-03-01
  day: 01
PublicationDecade 2020
PublicationTitle 浙江大学学报（理学版）
PublicationTitle_FL Journal of Zhejiang University(Science Edition)
PublicationYear 2024
Publisher 浙江理工大学 计算机科学与技术学院(人工智能学院),浙江 杭州 310018%江西财经大学 信息管理学院,江西 南昌 330032%浙江工商大学 管理工程与电子商务学院,浙江 杭州 310018
Publisher_xml – name: 浙江理工大学 计算机科学与技术学院(人工智能学院),浙江 杭州 310018%江西财经大学 信息管理学院,江西 南昌 330032%浙江工商大学 管理工程与电子商务学院,浙江 杭州 310018
SSID ssib001051298
ssib051373732
ssib002258177
ssib004369313
ssib008679801
ssib002476865
ssib023167501
ssib059160192
ssib000948450
ssib002040240
ssib001104615
ssib000969734
ssib008143637
ssib006704891
ssj0002507526
Score 2.3774867
Snippet O226; 给出了一类加工需要额外资源的平行机调度问题的精确算法.针对在平行机上加工的工件,除需要机器资源外,还需要一个单位额外资源的问题,考虑额外资源的种类和数量有限,...
SourceID wanfang
SourceType Aggregation Database
StartPage 321
Title 一类加工需要额外资源的平行机调度问题的算法设计
URI https://d.wanfangdata.com.cn/periodical/zjdxxb202403010
Volume 51
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  issn: 1008-9497
  databaseCode: DOA
  dateStart: 20220101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.doaj.org/
  omitProxy: false
  ssIdentifier: ssj0002507526
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  issn: 1008-9497
  databaseCode: M~E
  dateStart: 19990101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: false
  ssIdentifier: ssib059160192
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtR1Nb9RG1KKAql4QqK1KgSgH5rRaas94PG-O9q5XHAD1ABI3ZO96Wyq0IEJRxKECwQlx4MKHUJBIBBwjEKpaUql_oH-jm2z-Be89z3onm7TQQy_WZObN-3bmvbcz4yA4iYtUXMWDqm2UCdtxAapdhlXYhrIEWZWJkvVXS86Yc-fg4kX7_b4Df03Pwty8YkYjWF621_5XU2MfGpuOzv4HczdIsQPbaHR8otnx-UmGF3ksMqAdDLkRWSSyTORaQCrSkBqZEakWuRW2wzAg0gTDSepJpbBdgkljYRMaynBiLPJEZKmwjNCm3IN4rMgUT48EdAgGESIYzQoFKIZJCTnRQqL5lAR4eLgfR4mEElYzwlxkuWukkR89M5gW1nIjErbnuE0NN7pMrmkkLDXi7IkMha3pIm8-jBFgeaiGacoiHoWEWIbciQgwA2HuayVCJqDX6GUGgh2oTNYhsm0VKQGlsx6h2lxm54grxMh4thONX529VOBJ5aw7r5RWo84dKncWMwRqI08rNUu5UyFJyMBpz4OxxATaUwLDp4yq4YDFrd0BfSHr7jXR4vu9W54WT-4SdI3O5i36fSgCIbUnNRCdjBuoYsRH7j61wi7xYwIl8dnZ057TQ62QeadoOOzsptfit6k71SCK12kphauWnLK3y0Ebo6B_Ozrz7O3FjJuGT3avmVEMOVSm3Xwb7kBNLh_9syyfqGovVqGdSzaut7dPgxl3e_Nlv9bFkYmqLyJwQa6q7wiaj5-UAc3xExE41RA4Re7Od0G7Leg7b6i_9dNgebkkGKqvhJ8FB6TRlvbXnv0l93K5GGJ_C4VNrPHvpgwp9_B-wqfdJ16uIjHckLF_aF9DZPxak0nA37KhEqu8XCUxGKx4F4MBZoqJl5vRzaMQNuOSrgjRs791pHA5mx3C15hXU3rcFPQxlzSaP-_Z6O3z4KRT6nf_plI-LzoaFqMfvNTm_OHgkKtJLKb1WnIk2Hfrxy-D_O_fb2-9_WN8_8X4t1fbK7cnr-9srz0fv3w8-fXe5sbDrWf3xu_fTVYfbK5sTN7cHW-83n6yvr32FPu31p9svns0Wf9zsr76VXChl5_vnG67b-60lyKqJFa2iCppykFppCwUV-hgYIcFbX_pa93vD_th3B_IBAZVVEh8wQooyghjZmWGMFBfB_tHV0fVN8GihmEpB_1KJwlQmbAoMXiMS6M1mGI4rI4Gi07sS275XLo050rffhzkWPDF7J_x8WD_jes_VyeCg_2bNy4vXV_gEusCO-IHj1k5Kw
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E4%B8%80%E7%B1%BB%E5%8A%A0%E5%B7%A5%E9%9C%80%E8%A6%81%E9%A2%9D%E5%A4%96%E8%B5%84%E6%BA%90%E7%9A%84%E5%B9%B3%E8%A1%8C%E6%9C%BA%E8%B0%83%E5%BA%A6%E9%97%AE%E9%A2%98%E7%9A%84%E7%AE%97%E6%B3%95%E8%AE%BE%E8%AE%A1&rft.jtitle=%E6%B5%99%E6%B1%9F%E5%A4%A7%E5%AD%A6%E5%AD%A6%E6%8A%A5%EF%BC%88%E7%90%86%E5%AD%A6%E7%89%88%EF%BC%89&rft.au=%E6%B1%9F%E6%98%8E%E6%9C%88&rft.au=%E7%AE%80%E8%8B%8F%E5%B9%B3&rft.au=%E5%B4%94%E6%99%93%E9%BE%99&rft.au=%E4%B8%87%E9%BE%99&rft.date=2024-03-01&rft.pub=%E6%B5%99%E6%B1%9F%E7%90%86%E5%B7%A5%E5%A4%A7%E5%AD%A6+%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%A7%91%E5%AD%A6%E4%B8%8E%E6%8A%80%E6%9C%AF%E5%AD%A6%E9%99%A2%28%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD%E5%AD%A6%E9%99%A2%29%2C%E6%B5%99%E6%B1%9F+%E6%9D%AD%E5%B7%9E+310018%25%E6%B1%9F%E8%A5%BF%E8%B4%A2%E7%BB%8F%E5%A4%A7%E5%AD%A6+%E4%BF%A1%E6%81%AF%E7%AE%A1%E7%90%86%E5%AD%A6%E9%99%A2%2C%E6%B1%9F%E8%A5%BF+%E5%8D%97%E6%98%8C+330032%25%E6%B5%99%E6%B1%9F%E5%B7%A5%E5%95%86%E5%A4%A7%E5%AD%A6+%E7%AE%A1%E7%90%86%E5%B7%A5%E7%A8%8B%E4%B8%8E%E7%94%B5%E5%AD%90%E5%95%86%E5%8A%A1%E5%AD%A6%E9%99%A2%2C%E6%B5%99%E6%B1%9F+%E6%9D%AD%E5%B7%9E+310018&rft.issn=1008-9497&rft.volume=51&rft.issue=3&rft.spage=321&rft.epage=335&rft_id=info:doi/10.3785%2Fj.issn.1008-9497.2024.03.010&rft.externalDocID=zjdxxb202403010
thumbnail_s http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fzjdxxb%2Fzjdxxb.jpg