{"id":"https://openalex.org/W1523255954","doi":"https://doi.org/10.1109/etfa.2003.1248706","title":"A heuristic-based hybrid solution for parallel machine scheduling problems with earliness and tardiness penalties","display_name":"A heuristic-based hybrid solution for parallel machine scheduling problems with earliness and tardiness penalties","publication_year":2004,"publication_date":"2004-03-23","ids":{"openalex":"https://openalex.org/W1523255954","doi":"https://doi.org/10.1109/etfa.2003.1248706","mag":"1523255954"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2003.1248706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2003.1248706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108618496","display_name":"Hisashi Tamaki","orcid":null},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"H. Tamaki","raw_affiliation_strings":["Department Computer & Systems Engr. Faculty of Engineering, Kobe University, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department Computer & Systems Engr. Faculty of Engineering, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079819838","display_name":"Hajime Murao","orcid":"https://orcid.org/0000-0001-5877-1412"},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"H. Murao","raw_affiliation_strings":["Department of Communication Studies Faculty of Cross-Cultural Studies, Kobe University, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication Studies Faculty of Cross-Cultural Studies, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078551473","display_name":"Shinzo Kitamura","orcid":null},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"S. Kitamura","raw_affiliation_strings":["Department Computer & Systems Engr. Faculty of Engineering, Kobe University, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department Computer & Systems Engr. Faculty of Engineering, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8485,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76291937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"239","last_page":"244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9835000038146973,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9704490900039673},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7254570126533508},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7196407318115234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7013001441955566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6996124982833862},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5772824287414551},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5682445764541626},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.47350531816482544},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2648453116416931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1987307369709015},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07545056939125061}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9704490900039673},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7254570126533508},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7196407318115234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7013001441955566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6996124982833862},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5772824287414551},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5682445764541626},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.47350531816482544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2648453116416931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1987307369709015},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07545056939125061},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa.2003.1248706","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2003.1248706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EFTA 2003. 2003 IEEE Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.03TH8696)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1559215823","https://openalex.org/W1591102903","https://openalex.org/W2034026395","https://openalex.org/W2093563804","https://openalex.org/W2121061266","https://openalex.org/W2615854074","https://openalex.org/W4254292280","https://openalex.org/W4299584423","https://openalex.org/W6678036902","https://openalex.org/W6738345125"],"related_works":["https://openalex.org/W1999247335","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2084470113","https://openalex.org/W2061005265","https://openalex.org/W1992259816","https://openalex.org/W2060337406","https://openalex.org/W180477571","https://openalex.org/W4381616416","https://openalex.org/W3157291475"],"abstract_inverted_index":{"An":[0],"identical":[1],"parallel":[2],"machine":[3],"scheduling":[4,28],"problem":[5],"with":[6,26],"earliness":[7],"and":[8,41,56],"tardiness":[9],"penalties":[10],"is":[11,30],"studied.":[12],"First,":[13],"a":[14],"hybrid":[15],"method":[16,24,62],"adopting":[17],"the":[18,21,33,42,54,57,60],"meta-heuristics,":[19],"e.g.,":[20],"simulated":[22],"annealing":[23],"combined":[25],"list":[27],"techniques":[29],"proposed,":[31],"where":[32],"heuristic":[34],"procedure":[35],"MPA":[36],"(minimum":[37],"penalty":[38],"increase":[39],"assignment)":[40],"SD":[43],"(start-time":[44],"decision)":[45],"are":[46,63],"newly":[47],"introduced.":[48],"Then,":[49],"through":[50],"several":[51],"computational":[52],"experiments,":[53],"effectiveness":[55],"potential":[58],"of":[59],"proposed":[61],"investigated.":[64]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}