Simulated Annealing Algorithm for the Weighted Unrelated Parallel Machines Problem

In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is applied to the problem, which is modeled as a weighted bipartite matching problem. Experimental results with benchmarks are presented, evaluatin...

Full description

Saved in:
Bibliographic Details
Published inCERMA 2009 : 2009 Electronics, Robotics and Automotive Mechanics Conference : proceedings, 22-25 September 2009, Cuernavaca, Morelos, Mexico pp. 94 - 99
Main Authors Cruz-Chavez, M.A., Juarez-Perez, F., Avila-Melgar, E.Y., Martinez-Oropeza, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2009
Subjects
Ant colony optimization
Integer linear programming
Iterative algorithms
Job shop scheduling
Linear programming
Manufacturing industries
Parallel machines
Processor scheduling
Scheduling algorithm
Simulated annealing
Online AccessGet full text
ISBN9780769537993
0769537995
DOI10.1109/CERMA.2009.46

Cover

Abstract In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is applied to the problem, which is modeled as a weighted bipartite matching problem. Experimental results with benchmarks are presented, evaluating the efficiency and efficacy of the algorithm. It is then compared with an exact algorithm that solves the pondered model of integer linear programming. The results demonstrate that simulated annealing algorithm has high performance because for all the evaluated instances, it finds the optimum global solution.
AbstractList In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is applied to the problem, which is modeled as a weighted bipartite matching problem. Experimental results with benchmarks are presented, evaluating the efficiency and efficacy of the algorithm. It is then compared with an exact algorithm that solves the pondered model of integer linear programming. The results demonstrate that simulated annealing algorithm has high performance because for all the evaluated instances, it finds the optimum global solution.
Author Avila-Melgar, E.Y.
Cruz-Chavez, M.A.
Martinez-Oropeza, A.
Juarez-Perez, F.
Author_xml – sequence: 1
  givenname: M.A.
  surname: Cruz-Chavez
  fullname: Cruz-Chavez, M.A.
  organization: CIICAp, Univ. Autonoma del Estado de Morelos, Cuernavaca, Mexico
– sequence: 2
  givenname: F.
  surname: Juarez-Perez
  fullname: Juarez-Perez, F.
  organization: CIICAp, Univ. Autonoma del Estado de Morelos, Cuernavaca, Mexico
– sequence: 3
  givenname: E.Y.
  surname: Avila-Melgar
  fullname: Avila-Melgar, E.Y.
  organization: CIICAp, Univ. Autonoma del Estado de Morelos, Cuernavaca, Mexico
– sequence: 4
  givenname: A.
  surname: Martinez-Oropeza
  fullname: Martinez-Oropeza, A.
  organization: CIICAp, Univ. Autonoma del Estado de Morelos, Cuernavaca, Mexico
BookMark eNotjz1PwzAYhC1BJWjJyMTiP5Bgx3Hsd4yq8iG1oipUjJWTvEmMHAc5YeDfk6rccsM9Ot0tybUfPBJyz1nCOYPH9eawK5KUMUiy_IpEoDRTOUihAMSCLM8JMAkcbkg0jl9slkxzUOKWHN5t_-PMhDUtvEfjrG9p4doh2KnraTMEOnVIP9G23Rk6-oAXfG-CcQ4d3Zmqsx5Hug9D6bC_I4vGuBGjf1-R49PmY_0Sb9-eX9fFNrZcySnOckRRSyNlqSDjVQUSsNSNLo0QUmveKIG65FWjTY2YoeAmNVlVM9GkYh6_Ig-XXouIp-9gexN-T1Jk818p_gBvM1KG
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CERMA.2009.46
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore
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
EndPage 99
ExternalDocumentID 5342005
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-46ee3d5a55b7941cc959eb8f8ba335881f73e8b1cf8adee4e31a2a4cd03f23973
IEDL.DBID RIE
ISBN 9780769537993
0769537995
IngestDate Wed Aug 27 02:37:42 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2009905919
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-46ee3d5a55b7941cc959eb8f8ba335881f73e8b1cf8adee4e31a2a4cd03f23973
PageCount 6
ParticipantIDs ieee_primary_5342005
PublicationCentury 2000
PublicationDate 2009-Sept.
PublicationDateYYYYMMDD 2009-09-01
PublicationDate_xml – month: 09
  year: 2009
  text: 2009-Sept.
PublicationDecade 2000
PublicationTitle CERMA 2009 : 2009 Electronics, Robotics and Automotive Mechanics Conference : proceedings, 22-25 September 2009, Cuernavaca, Morelos, Mexico
PublicationTitleAbbrev CERMA
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000526973
Score 1.4415183
Snippet In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is...
SourceID ieee
SourceType Publisher
StartPage 94
SubjectTerms Ant colony optimization
Integer linear programming
Iterative algorithms
Job shop scheduling
Linear programming
Manufacturing industries
Parallel machines
Processor scheduling
Scheduling algorithm
Simulated annealing
Title Simulated Annealing Algorithm for the Weighted Unrelated Parallel Machines Problem
URI https://ieeexplore.ieee.org/document/5342005
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NT8IwFG-Qk178AON3evBogdF2646EQIjJDEGJ3EjbvSkRNoPj4l9v38ZXjAdvXbukTbv1_fr6fr9HyL07MQQtsMAsWM1ELDRDGSmmjXTfUIIIAf0d0ZM_GIvHiZxUyMOWCwMARfAZNLBY3OXHmV2hq6wpuSgFSw8C5Zdcra0_BXVLwoCXJ_NQchQ6WwvsbJ75TmOz2e2Nok4pV4nYdy-zSmFY-sck2gypjCf5aKxy07Dfv9Qa_zvmE1LfUfjocGucTkkF0jNytKc-WCOj59kCk3dBTDtut9VITKed-Vu2nOXvC-rQLHXokL4WzlP30jgtiC-uNNRLTMEyp1ERiglf2BXmpamTcb_30h2wdYoFNnO4IWfCB-Cx1FIa92N61oYyBKMSZTTnUikvCTgo49lE6RhAAPd0Wwsbu3VsOyjDz0k1zVK4INS1eshL9Vo6ECZUYez2L1-1dFvpQIJ_SWo4O9PPUkVjup6Yq7-rr8lheW-D0Vw3pJovV3DrzH9u7op1_wFG7av1
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT8IwGG4IHtSLH2D8tgePDhhtt-5ICASVEYIQuZG2e1EiDIPj4q-378ZXjAdv3Ueypu3ap2_f53kIubc7Br8CBhwDRjk84spBGSlHaWHH0BgRAsY7wo7XGvCnoRjmyMOGCwMAafIZlLCYnuVHc7PEUFlZMJ4Jlu4JzrnI2FqbiAoqlwQ-y_bmgWAodbaS2Flfs63KZrne6IW1TLAS0e-Ot0q6tDSPSLiuVJZR8lFaJrpkvn_pNf631sekuCXx0e5meTohOYhPyeGO_mCB9F4mM7TvgojW7HyrkJpOa9O3-WKSvM-oxbPU4kP6moZP7UuDOKW-2FJXLdCEZUrDNBkTvvBT6ExTJINmo19vOSuTBWdikUPicA-ARUIJoe2v6RoTiAC0HEutGBNSumOfgdSuGUsVAXBgrqoqbiLbk1ULZtgZycfzGM4JtU9dZKa6FeVzHcggsjOYJyuqKpUvwLsgBWyd0WemozFaNczl37fvyH6rH7ZH7cfO8xU5yE5xMLfrmuSTxRJuLBhI9G06Bn4AeuWvQg
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=CERMA+2009+%3A+2009+Electronics%2C+Robotics+and+Automotive+Mechanics+Conference+%3A+proceedings%2C+22-25+September+2009%2C+Cuernavaca%2C+Morelos%2C+Mexico&rft.atitle=Simulated+Annealing+Algorithm+for+the+Weighted+Unrelated+Parallel+Machines+Problem&rft.au=Cruz-Chavez%2C+M.A.&rft.au=Juarez-Perez%2C+F.&rft.au=Avila-Melgar%2C+E.Y.&rft.au=Martinez-Oropeza%2C+A.&rft.date=2009-09-01&rft.pub=IEEE&rft.isbn=9780769537993&rft.spage=94&rft.epage=99&rft_id=info:doi/10.1109%2FCERMA.2009.46&rft.externalDocID=5342005
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769537993/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769537993/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769537993/sc.gif&client=summon&freeimage=true