Unrelated-machines scheduling: Difference between revisions

Revision as of 17:22, 5 January 2024

Revision as of 14:39, 24 March 2024

Line 60:

Kim, Kim, Jang and Chen<ref>{{Cite journal|date=2002-06-01|title=Unrelated parallel machine scheduling with setup times using simulated annealing|url=https://www.sciencedirect.com/science/article/abs/pii/S0736584502000133|journal=Robotics and Computer-Integrated Manufacturing|language=en|volume=18|issue=3–4|pages=223–231|doi=10.1016/S0736-5845(02)00013-3|issn=0736-5845|last1=Kim |first1=Dong-Won |last2=Kim |first2=Kyong-Hee |last3=Jang |first3=Wooseung |last4=Frank Chen |first4=F. }}</ref> extend the problem by allowing each job to have a setup time, which depends on the job but not on the machine. They present a solution using [[simulated annealing]]. Vallada and Ruiz<ref>{{Cite journal|date=2011-06-16|title=A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times|url=https://www.sciencedirect.com/science/article/abs/pii/S0377221711000142|journal=European Journal of Operational Research|language=en|volume=211|issue=3|pages=612–622|doi=10.1016/j.ejor.2011.01.011|issn=0377-2217|hdl-access=free|hdl=10251/35412|last1=Vallada |first1=Eva |last2=Ruiz |first2=Rubén }}</ref> present a solution using a [[genetic algorithm]].

Caragiannis<ref>{{CiteNisan journal|date=2011-06-16|title=Aand geneticRonen algorithmin fortheir the1999 unrelatedpaper parallelon machine[[algorithmic schedulingmechanism problemdesign]].<ref withname=NisanRonen01>{{Cite sequence dependent setup timesjournal|urldoi=https:10.1006//wwwgame.sciencedirect1999.com/science/article/abs/pii/S03772217110001420790|title=Algorithmic Mechanism Design|journal=EuropeanGames Journaland ofEconomic Operational Research|language=enBehavior|volume=21135|issue=31–2|pages=612–622166–196|doi=10.1016/j.ejor.2011.01.011|issn=0377-2217|hdl=10251/35412|hdl-accessyear=free2001|last1=Vallada Nisan|first1=Eva Noam|last2=Ruiz Ronen|first2=Rubén Amir|citeseerx=10.1.1.16.7473}}</ref> extendsextend the problem in a different way, by assuming that the jobs are owned by selfish agents (see [[Truthful job scheduling]]).

== External links ==