Minimizing total weighted completion time on a batch-processing machine with re-entrance
The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the machine is infinite and there are different processing types in the same machine. This problem can be transformed into a model with parallel cha...
Saved in:
Published in | 2009 IEEE International Conference on Automation and Logistics pp. 1791 - 1794 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.08.2009
|
Subjects | |
Online Access | Get full text |
ISBN | 9781424447947 1424447941 |
ISSN | 2161-8151 |
DOI | 10.1109/ICAL.2009.5262674 |
Cover
Abstract | The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the machine is infinite and there are different processing types in the same machine. This problem can be transformed into a model with parallel chains precedence constraint. A polynomial time heuristic algorithm for the problem is given. Experimentation results show that the algorithm is efficient. |
---|---|
AbstractList | The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the machine is infinite and there are different processing types in the same machine. This problem can be transformed into a model with parallel chains precedence constraint. A polynomial time heuristic algorithm for the problem is given. Experimentation results show that the algorithm is efficient. |
Author | Hongyu Li Rui Zheng |
Author_xml | – sequence: 1 surname: Rui Zheng fullname: Rui Zheng organization: Dept. of Manage. Sci. Sch. of Manage., Fudan Univ. Shanghai, Shanghai, China – sequence: 2 surname: Hongyu Li fullname: Hongyu Li organization: Dept. of Manage. Sci. Sch. of Manage., Fudan Univ. Shanghai, Shanghai, China |
BookMark | eNpVkMFKAzEURSO2YFv7AeImPzA1L3mZJEspWoWKGwV3Jc286UQ6mTITKPr1WuzG1eEuzoV7p2yUukSM3YBYAAh397y8Xy-kEG6hZSlLgxds7owFlIhonMbLfxnNiE0klFBY0DBm05PqhFbGXbH5MHwKIUAY54ybsI-XmGIbv2Pa8dxlv-dHirsmU8VD1x72lGOXeI4t8V96vvU5NMWh7wINw0lqfWhiIn6MueE9FZRy71Ogazau_X6g-Zkz9v748LZ8Ktavq9OgIoLRubBB0pasV1QHW8uAICVaE2xlsNK-omC8BMRSWVd7p0AG0BgqJcpQ29qrGbv9641EtDn0sfX91-Z8lPoB4t5apQ |
ContentType | Conference Proceeding |
DBID | 6IE 6IL CBEJK RIE RIL |
DOI | 10.1109/ICAL.2009.5262674 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISBN | 9781424447954 142444795X |
EndPage | 1794 |
ExternalDocumentID | 5262674 |
Genre | orig-research |
GroupedDBID | 6IE 6IF 6IH 6IK 6IL 6IN AAJGR AAWTH ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL |
ID | FETCH-LOGICAL-i175t-8c2ebe8a3efc8f2c4122487c8d74d5adec7a21446389fa9312c154cd306cf8fa3 |
IEDL.DBID | RIE |
ISBN | 9781424447947 1424447941 |
ISSN | 2161-8151 |
IngestDate | Wed Aug 27 02:28:28 EDT 2025 |
IsPeerReviewed | false |
IsScholarly | false |
LCCN | 2009905379 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-i175t-8c2ebe8a3efc8f2c4122487c8d74d5adec7a21446389fa9312c154cd306cf8fa3 |
PageCount | 4 |
ParticipantIDs | ieee_primary_5262674 |
PublicationCentury | 2000 |
PublicationDate | 2009-Aug. |
PublicationDateYYYYMMDD | 2009-08-01 |
PublicationDate_xml | – month: 08 year: 2009 text: 2009-Aug. |
PublicationDecade | 2000 |
PublicationTitle | 2009 IEEE International Conference on Automation and Logistics |
PublicationTitleAbbrev | ICAL |
PublicationYear | 2009 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
SSID | ssj0001079979 ssj0000453144 |
Score | 1.4251217 |
Snippet | The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 1791 |
SubjectTerms | Automation batch-processing Billets chains precedence constraints Circuit testing Conference management Heat treatment heuristic algorithm Heuristic algorithms Job shop scheduling Logistics Polynomials Project management re-entrance Scheduling |
Title | Minimizing total weighted completion time on a batch-processing machine with re-entrance |
URI | https://ieeexplore.ieee.org/document/5262674 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07a8MwED7STO3SR1L6RkPHKrFlu5Ln0hAKKR0ayBZk6URNyYPgUMiv70l20gcdOtkyGNnSofv03d0ngNsCIy3QFFzS9oenLkJekB_kWeLIGVgyGe0J_dHz_XCcPk2ySQvudrUwiBiSz7Dnb0Ms3y7M2lNl_UwQ_JbpHuyRmdW1Wjs-haBJEjeuKvArkczzILUnCNRwRZ5tW9flRdXjrdxT05ZNxDOO8r4XIqiVLJsOf5y8EhzP4BBG20-u803ee-uq6JnNLzXH__7TEXS_SvzYy855HUML5ydw8E2dsAOTUTkvZ-WGGqxaEEhnH4FHRctCIjr6OWX-cHpGV80KWtXf-LKuPPAvzUKiJjLP9bIV8kAkU8ddGA8eXx-GvDmIgZeELiqujKC5VjpBZ5QTJvXhOCWNsjK1mbZopA7Sa4R-nM6TWBhCZsbSdsQ45XRyCu35Yo5nwAqTS8IcSucqTYX1YvaxS3Qc20z49eAcOn6Mpstaa2PaDM_F348vYb-O7viEvCtoV6s1XhNIqIqbYB2fiuu0ig |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZKGYCFR4t444ERt4njYGdGoAJNxdBK3SrHDxGhplWVCqm_nrOTlocYmBJHipzYlu_zd3ffIXSTmUBSozLC4fhDmA0MycAOkjiyYAw0LBnpCP10cNcbsedxPG6g200ujDHGB5-Zjrv1vnw9U0tHlXVjCvCbsy20DXafxVW21oZRAXAShbWx8gxLwJPEi-1RgDVEgG1bZ3Y5WfVwLfhUt3nt8wyDpOukCCoty7rLH7VXvOl53Efp-qOriJP3zrLMOmr1S8_xv391gNpfSX74dWO-DlHDFEdo75s-YQuN07zIp_kKGricAUzHH55JNRr7UHTjZhW78vQYrhJnsK-_kXmVe-BemvpQTYMd24sXhngqGTpuo9Hjw_C-R-pSDCQHfFESoSjMtpCRsUpYqphzyAmuhOZMx1IbxaUXXwP8Y2UShVQBNlMaDiTKCiujY9QsZoU5QThTCQfUIWQiGKPaydmHNpJhqGPqdoRT1HJjNJlXahuTenjO_n58jXZ6w7Q_6T8NXs7RbuXrceF5F6hZLpbmEiBDmV35lfIJNPS31w |
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%3Abook&rft.genre=proceeding&rft.title=2009+IEEE+International+Conference+on+Automation+and+Logistics&rft.atitle=Minimizing+total+weighted+completion+time+on+a+batch-processing+machine+with+re-entrance&rft.au=Rui+Zheng&rft.au=Hongyu+Li&rft.date=2009-08-01&rft.pub=IEEE&rft.isbn=9781424447947&rft.issn=2161-8151&rft.spage=1791&rft.epage=1794&rft_id=info:doi/10.1109%2FICAL.2009.5262674&rft.externalDocID=5262674 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2161-8151&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2161-8151&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2161-8151&client=summon |