{"id":"https://openalex.org/W2048631059","doi":"https://doi.org/10.1080/00207549408957026","title":"Scheduling a single batch processing machine with non-identical job sizes","display_name":"Scheduling a single batch processing machine with non-identical job sizes","publication_year":1994,"publication_date":"1994-07-01","ids":{"openalex":"https://openalex.org/W2048631059","doi":"https://doi.org/10.1080/00207549408957026","mag":"2048631059"},"language":"en","primary_location":{"id":"doi:10.1080/00207549408957026","doi":"https://doi.org/10.1080/00207549408957026","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207549408957026","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","fnege-2","jufo-2","ki-jl-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"volume":null,"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/A5044657641","display_name":"Reha Uzsoy","orcid":"https://orcid.org/0000-0002-8068-550X","observed_orcids":["https://orcid.org/0000-0002-8068-550X"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. UZSOY","raw_affiliation_strings":["School of Industrial Engineering, Purdue University, 1287 Grissom Hall, West Lafayette, IN, 47907-1287, USA","School of Industrial Engineering, Purdue University , 1287 Grissom Hall, West Lafayette, IN, 47907-1287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, Purdue University, 1287 Grissom Hall, West Lafayette, IN, 47907-1287, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"School of Industrial Engineering, Purdue University , 1287 Grissom Hall, West Lafayette, IN, 47907-1287, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044657641"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":10.7514,"has_fulltext":false,"cited_by_count":391,"citation_normalized_percentile":{"value":0.97812553,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"32","issue":"7","first_page":"1615","last_page":"1635"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/batch-scheduling","display_name":"batch scheduling","score":0.6880000233650208},{"id":"https://openalex.org/keywords/non-identical-job-sizes","display_name":"non-identical job sizes","score":0.9900000095367432},{"id":"https://openalex.org/keywords/total-completion-time","display_name":"total completion time","score":0.7689999938011169},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9169999957084656},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9900000095367432},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.8199999928474426},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9380000233650208}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8415665626525879},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7864779233932495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6441712975502014},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.6398061513900757},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6313654780387878},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5859866142272949},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.42697176337242126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4190523326396942},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.41662395000457764},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.41514867544174194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29190272092819214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22592759132385254},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.061326414346694946},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"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.1080/00207549408957026","doi":"https://doi.org/10.1080/00207549408957026","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207549408957026","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","fnege-2","jufo-2","ki-jl-2","norway-2","poland-140","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5899999737739563}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W572185210","https://openalex.org/W1519941054","https://openalex.org/W1966303191","https://openalex.org/W2011039300","https://openalex.org/W2016653853","https://openalex.org/W2017896057","https://openalex.org/W2031612682","https://openalex.org/W2034279788","https://openalex.org/W2043862089","https://openalex.org/W2044439396","https://openalex.org/W2065104323","https://openalex.org/W2084517692","https://openalex.org/W2092438148","https://openalex.org/W2111001493","https://openalex.org/W2114338779","https://openalex.org/W2132273100"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,61],"scheduling":[3],"jobs":[4],"with":[5],"non-identical":[6],"capacity":[7],"requirements":[8],"or":[9],"sizes":[10],"on":[11],"a":[12,42],"single":[13],"batch":[14],"processing":[15],"machine":[16],"to":[17,30],"minimize":[18],"total":[19,49],"completion":[20,50],"time":[21,51],"and":[22,33,44],"makespan":[23],"is":[24],"studied.":[25],"These":[26],"problems":[27],"are":[28,35,59],"proven":[29],"be":[31],"NP-hard":[32],"heuristics":[34,58],"developed":[36],"for":[37,47],"both,":[38],"as":[39,41],"well":[40],"branch":[43],"bound":[45],"algorithm":[46],"the":[48,57],"problem.":[52],"Computational":[53],"experiments":[54],"show":[55],"that":[56],"capable":[60],"rapidly":[62],"obtaining":[63],"near-optimal":[64],"solutions.":[65]},"counts_by_year":[{"year":2026,"cited_by_count":13},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":25},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":13}],"updated_date":"2026-10-08T09:06:37.294493","created_date":"2025-10-10T00:00:00"}