{"id":"https://openalex.org/W1966508610","doi":"https://doi.org/10.1007/s00453-004-1083-4","title":"Minimizing Makespan in Batch Machine Scheduling","display_name":"Minimizing Makespan in Batch Machine Scheduling","publication_year":2004,"publication_date":"2004-02-16","ids":{"openalex":"https://openalex.org/W1966508610","doi":"https://doi.org/10.1007/s00453-004-1083-4","mag":"1966508610"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1083-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1083-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-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/A5036513568","display_name":"Chung Keung Poon","orcid":"https://orcid.org/0000-0002-8508-5060"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Chung Keung Poon","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Sandford Fleming Building, 10 King\u2019s College\nRoad, Toronto, Ontario, Canada M5S 3G4","Department of Computer Science, University of Toronto, Sandford Fleming Building, 10 King\u2019s College Road, Toronto, Ontario, Canada M5S 3G4#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Sandford Fleming Building, 10 King\u2019s College\nRoad, Toronto, Ontario, Canada M5S 3G4","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Sandford Fleming Building, 10 King\u2019s College Road, Toronto, Ontario, Canada M5S 3G4#TAB#","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034909819","display_name":"Pixing Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pixing Zhang","raw_affiliation_strings":["Department of Information and Computer Science, University of California, Irvine, CA 92697-3425, USA"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computer Science, University of California, Irvine, CA 92697-3425, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036513568"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.9259,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.95035751,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"2","first_page":"155","last_page":"174"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9940999746322632,"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/theory-of-computation","display_name":"Theory of computation","score":0.7047039866447449},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6789791584014893},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6320767998695374},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5561208724975586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5180771350860596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5162374973297119},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49357521533966064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4907573163509369},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4419686496257782},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.43862152099609375},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43198826909065247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37541887164115906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32361721992492676},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2749108672142029},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07133522629737854}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7047039866447449},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6789791584014893},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6320767998695374},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5561208724975586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5180771350860596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5162374973297119},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49357521533966064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4907573163509369},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4419686496257782},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.43862152099609375},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43198826909065247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37541887164115906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32361721992492676},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2749108672142029},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07133522629737854},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-004-1083-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1083-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W2016906275","https://openalex.org/W2021261368","https://openalex.org/W2034279788","https://openalex.org/W2102773353","https://openalex.org/W2111001493","https://openalex.org/W2136186989"],"related_works":["https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2136838521","https://openalex.org/W2113270940","https://openalex.org/W2004283824","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W2007359222","https://openalex.org/W1581210843","https://openalex.org/W1992104669"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}