{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:00:13Z","timestamp":1743080413109,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353796"},{"type":"electronic","value":"9783642353802"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35380-2_24","type":"book-chapter","created":{"date-parts":[[2012,12,15]],"date-time":"2012-12-15T00:00:04Z","timestamp":1355529604000},"page":"198-205","source":"Crossref","is-referenced-by-count":1,"title":["A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling"],"prefix":"10.1007","author":[{"given":"Dipak","family":"Laha","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science\u00a06, 1\u20138 (1959)","journal-title":"Management Science"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T.C.E. Chen","year":"1990","unstructured":"Chen, T.C.E., Sin, C.C.S.: A state-of-the-art review of parallel-machine scheduling research. Euro. J. Oper. Res.\u00a047, 271\u2013292 (1990)","journal-title":"Euro. J. Oper. Res."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s00170-005-0188-5","volume":"31","author":"W.-C. Lee","year":"2006","unstructured":"Lee, W.-C., Wu, C.-C., Chen, P.: A simulated annealing approach to makespan minimization on identical parallel machines. Int. J. Adv. Manuf. Technol.\u00a031, 328\u2013334 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"24_CR4","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math.\u00a017, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman","year":"1978","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multi- processor scheduling. SIAM J. Comput.\u00a07, 1\u201317 (1978)","journal-title":"SIAM J. Comput."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(88)90079-0","volume":"20","author":"C.Y. Lee","year":"1988","unstructured":"Lee, C.Y., Massey, J.D.: Multiprocessor scheduling combining LPT and MULTIFIT. Discrete Appl. Math.\u00a020, 233\u2013242 (1988)","journal-title":"Discrete Appl. Math."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1080\/095372898233687","volume":"9","author":"S.M.T. Ghomi","year":"1998","unstructured":"Ghomi, S.M.T., Ghazvini, F.J.: A pairwise interchange algorithm for parallel machine scheduling. Prod. Plan Control\u00a09, 685\u2013689 (1998)","journal-title":"Prod. Plan Control"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1080\/09537280150203951","volume":"12","author":"J.N.D. Gupta","year":"2001","unstructured":"Gupta, J.N.D., Ruiz-Torres, J.: A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod. Plan Control\u00a012, 28\u201336 (2001)","journal-title":"Prod. Plan Control"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I.H. Osman","year":"1989","unstructured":"Osman, I.H., Potts, C.M.: Simulated annealing for permutation flowshop scheduling. Omega\u00a017, 551\u2013557 (1989)","journal-title":"Omega"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.engappai.2006.10.003","volume":"20","author":"D. Laha","year":"2007","unstructured":"Laha, D., Chakraborty, U.K.: An efficient stochastic hybrid heuristic for flowshop scheduling. Eng. Appl. Artif. Intell.\u00a020, 851\u2013856 (2007)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1016\/j.cor.2004.01.003","volume":"32","author":"C. Low","year":"2005","unstructured":"Low, C.: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput. Oper. Res.\u00a032, 2013\u20132025 (2005)","journal-title":"Comput. Oper. Res."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1080\/00207540050028070","volume":"38","author":"S. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, S., Ventura, S.: Simulated annealing for parallel machine scheduling problem with earliness-tardiness penalties and sequence-dependent set-up times. Int. J. Prod. Res.\u00a038, 2233\u20132252 (2000)","journal-title":"Int. J. Prod. Res."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0360-8352(97)00087-9","volume":"33","author":"A.J. Ruiz-Torres","year":"1997","unstructured":"Ruiz-Torres, A.J., Enscore, E.E., Barton, A.A.: Simulated annealing heuristics for the average flow-time and number of tardy jobs bi-criteria identical parallel machine problem. Comput. Ind. Eng.\u00a033, 257\u2013260 (1997)","journal-title":"Comput. Ind. Eng."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"9637","DOI":"10.1016\/j.eswa.2008.10.007","volume":"36","author":"J. Behnamian","year":"2009","unstructured":"Behnamian, J., Zandieh, M., Ghomi, S.M.T.: Parallel-machine scheduling problems with sequence-dependent setup times using ACO, SA and VNS hybrid algorithm. Exp. Sys. Appl.\u00a036, 9637\u20139644 (2009)","journal-title":"Exp. Sys. Appl."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"P.Y. Chang","year":"2004","unstructured":"Chang, P.Y., Damodaran, P., Melouk, S.: Minimizing makespan on parallel batch processing machines. Int. J. Prod. Res.\u00a042, 4211\u20134220 (2004)","journal-title":"Int. J. Prod. Res."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1243\/09544054JEM779","volume":"221","author":"S. Kim","year":"2007","unstructured":"Kim, S., Choi, H.S., Lee, D.H.: Scheduling algorithms for parallel machines with sequence-dependent set-up and distinct ready times: Minimizing total tardiness. J. Eng. Manuf.\u00a0221, 1087\u20131096 (2007)","journal-title":"J. Eng. Manuf."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1016\/j.eswa.2011.08.029","volume":"39","author":"P. Damodaran","year":"2012","unstructured":"Damodaran, P., Velez-Gallego, M.C.: A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Exp. Sys. Appl.\u00a039, 1451\u20131457 (2012)","journal-title":"Exp. Sys. Appl."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"5551","DOI":"10.1016\/j.asoc.2011.05.005","volume":"11","author":"K. Li","year":"2011","unstructured":"Li, K., Shi, Y., Yang, S.-L., Cheng, B.-Y.: Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl. Soft. Comp. J.\u00a011, 5551\u20135557 (2011)","journal-title":"Appl. Soft. Comp. J."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.mcm.2010.10.022","volume":"53","author":"K. Li","year":"2011","unstructured":"Li, K., Yang, S.-L., Ma, H.-W.: A simulated annealing approach to minimize the maximum lateness on uniform parallel machines. Math. Comp. Model\u00a053, 854\u2013860 (2011)","journal-title":"Math. Comp. Model"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/S0377-2217(95)00376-2","volume":"100","author":"Y.H. Lee","year":"1997","unstructured":"Lee, Y.H., Pinedo, M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Euro. J. Oper. Res.\u00a0100, 464\u2013474 (1997)","journal-title":"Euro. J. Oper. Res."},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Aarts, E.H.L., Korst, J.H.M.: Simulated annealing and Boltzman machines, Chichester (1989)","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"24_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: Theory and applications","author":"P.J.M. Van Laarhoven","year":"1987","unstructured":"Van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing: Theory and applications. Reidel, Dordrecht (1987)"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35380-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T10:08:44Z","timestamp":1676282924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35380-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353796","9783642353802"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35380-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}