{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T05:19:01Z","timestamp":1739251141971,"version":"3.37.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,7,3]],"date-time":"2009-07-03T00:00:00Z","timestamp":1246579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10845-009-0285-7","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:17:26Z","timestamp":1246547846000},"page":"247-261","source":"Crossref","is-referenced-by-count":12,"title":["A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines"],"prefix":"10.1007","volume":"22","author":[{"given":"F.","family":"Jolai","sequence":"first","affiliation":[]},{"given":"M. S.","family":"Amalnick","sequence":"additional","affiliation":[]},{"given":"M.","family":"Alinaghian","sequence":"additional","affiliation":[]},{"given":"M.","family":"Shakhsi-Niaei","sequence":"additional","affiliation":[]},{"given":"H.","family":"Omrani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,3]]},"reference":[{"key":"285_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/nav.3800210112","volume":"21","author":"K. R. Baker","year":"1974","unstructured":"Baker K. R., Su Z. S. (1974) Sequencing with due dates and early start times to minimize maximum tardiness. Naval Research Logistics Quarterly 21: 171\u2013176","journal-title":"Naval Research Logistics Quarterly"},{"key":"285_CR2","first-page":"1","volume":"31","author":"J. Blazewicz","year":"1987","unstructured":"Blazewicz J. (1987) Selected topics in scheduling theory. Annals of Discrete Mathematics 31: 1\u201360","journal-title":"Annals of Discrete Mathematics"},{"key":"285_CR3","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1016\/j.cor.2004.05.011","volume":"32","author":"O. \u010cepek","year":"2005","unstructured":"\u010cepek O., Sung S. C. (2005) A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines. Computers & Operations Research 32: 3265\u20133271","journal-title":"Computers & Operations Research"},{"key":"285_CR4","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1145\/322276.322284","volume":"28","author":"E. Davis","year":"1981","unstructured":"Davis E., Jaffe J. M. (1981) Algorithms for scheduling tasks on unrelated parallel processors. Journal of the Association of Computing Machinery 28: 721\u2013736","journal-title":"Journal of the Association of Computing Machinery"},{"issue":"7","key":"285_CR5","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"N. G. Hall","year":"2001","unstructured":"Hall N. G. (2001) Generating experimental data for computational testing with machine scheduling applications. Operations Research 49(7): 854\u2013865","journal-title":"Operations Research"},{"key":"285_CR6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/0377-2217(86)90190-6","volume":"26","author":"N. G. Hall","year":"1986","unstructured":"Hall N. G., Rhee W. T. (1986) Average and worst-case analysis of heuristics for the maximum tardiness problem. European Journal of Operational Research 26: 272\u2013277","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"285_CR7","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/S0305-0548(00)00086-1","volume":"29","author":"K. Hiraishi","year":"2002","unstructured":"Hiraishi K., Levner E., Vlach M. (2002) Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers & Operations Research 29(7): 841\u2013848","journal-title":"Computers & Operations Research"},{"key":"285_CR8","volume-title":"Adaptation in natural and artificial systems","author":"J. H. Holland","year":"1975","unstructured":"Holland J. H. (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, MI"},{"key":"285_CR9","unstructured":"Huang, J. C.-C. (1995). Decision support system for lumber procurement and dry kiln scheduling: A fuzzy system theory application. Industrial Engineering Department, Unpublished Ph.D. Dissertation. North Carolina State University, Raleigh, NC."},{"key":"285_CR10","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A. Lann","year":"1996","unstructured":"Lann A., Mosheiov G. (1996) Single machine scheduling to minimize the number of early and tardy jobs. Computers & Operations Research 23: 765\u2013781","journal-title":"Computers & Operations Research"},{"key":"285_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J. K. Lenstra","year":"1990","unstructured":"Lenstra J. K., Schmoys D. B., Tardos E. (1990) Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46: 259\u2013271","journal-title":"Mathematical Programming"},{"key":"285_CR12","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"C.-L. Li","year":"1997","unstructured":"Li C.-L., Lee C.-Y. (1997) Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research 96: 564\u2013569","journal-title":"European Journal of Operational Research"},{"key":"285_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M. Mitchell","year":"1996","unstructured":"Mitchell M. (1996) An introduction to genetic algorithms. Massachusetts Institute of Technology, London, England"},{"key":"285_CR14","first-page":"219","volume-title":"New ideas in optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato P. (1999) Memetic algorithms: A short introduction. In: Corne D., Dorigo M., Glover F. (eds) New ideas in optimization. McGraw-Hill, New York, pp 219\u2013234"},{"key":"285_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S. S. Panwalkar","year":"1977","unstructured":"Panwalkar S. S., Iskander W. (1977) A survey of scheduling rules. Operations Research 25: 45\u201361","journal-title":"Operations Research"},{"key":"285_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0895-7177(96)00150-1","volume":"24","author":"N. Piersma","year":"1996","unstructured":"Piersma N., Van Dijk W. (1996) A local search heuristic for unrelated machine scheduling with efficient neighborhood search. Mathematical and Computational Modelling 24: 11\u201319","journal-title":"Mathematical and Computational Modelling"},{"key":"285_CR17","unstructured":"Portmann, M. C. (1996). Genetic algorithms and scheduling: A state of the art and some propositions. Proceedings of the Workshop on Production Planning and Control, Mons, Belgium."},{"key":"285_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","volume":"10","author":"C. N. Potts","year":"1985","unstructured":"Potts C. N. (1985) Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics 10: 155\u2013164","journal-title":"Discrete Applied Mathematics"},{"key":"285_CR19","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10845-005-5514-0","volume":"17","author":"G. Rabadi","year":"2006","unstructured":"Rabadi G., Moraga R. J., Al-Salem A. (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing 17: 85\u201397","journal-title":"Journal of Intelligent Manufacturing"},{"key":"285_CR20","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/322203.322214","volume":"27","author":"S. Sahni","year":"1980","unstructured":"Sahni S., Cho Y. (1980) Scheduling independent tasks with due time on a uniform processor system. Journal of the Association for Computing Machinery 27: 550\u2013563","journal-title":"Journal of the Association for Computing Machinery"},{"key":"285_CR21","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10951-005-2863-7","volume":"8","author":"S. C. Sung","year":"2005","unstructured":"Sung S. C., Vlach M. (2005) Maximizing weighted number of just-in-time jobs on unrelated parallel machines. Journal of Scheduling 8: 453\u2013460","journal-title":"Journal of Scheduling"},{"key":"285_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0925-5273(94)90038-8","volume":"34","author":"V. Suresh","year":"1994","unstructured":"Suresh V., Haudhuri D. C. (1994) Minimizing maximum tardiness for unrelated parallel machines. International Journal of Production Economics 34: 223\u2013229","journal-title":"International Journal of Production Economics"},{"key":"285_CR23","doi-asserted-by":"crossref","unstructured":"Toksar\u0131, M. D., & G\u00fcner, E. (2009). Parallel machine scheduling problem to minimize the earliness\/tardiness costs with learning effect and deteriorating jobs. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-009-0260-3 .","DOI":"10.1007\/s10845-009-0260-3"},{"key":"285_CR24","first-page":"733","volume":"31","author":"A. Yaghubian","year":"1999","unstructured":"Yaghubian A., Hodgson T. J., Joines J. A., Culbreth C. T., Huang J. C. (1999) Dry kiln scheduling in furniture production. IIE Transactions 31: 733\u2013738","journal-title":"IIE Transactions"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0285-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-009-0285-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-009-0285-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T16:45:27Z","timestamp":1739205927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-009-0285-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s10845-009-0285-7","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"type":"print","value":"0956-5515"},{"type":"electronic","value":"1572-8145"}],"subject":[],"published":{"date-parts":[[2009,7,3]]}}}