{"id":"https://openalex.org/W3205966826","doi":"https://doi.org/10.1007/s10878-021-00821-2","title":"Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times","display_name":"Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times","publication_year":2021,"publication_date":"2021-10-16","ids":{"openalex":"https://openalex.org/W3205966826","doi":"https://doi.org/10.1007/s10878-021-00821-2","mag":"3205966826"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-021-00821-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-021-00821-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-021-00821-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-021-00821-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072636624","display_name":"Bart\u0142omiej Przybylski","orcid":"https://orcid.org/0000-0001-8283-7872"},"institutions":[{"id":"https://openalex.org/I59411706","display_name":"Adam Mickiewicz University in Pozna\u0144","ror":"https://ror.org/04g6bbq64","country_code":"PL","type":"education","lineage":["https://openalex.org/I59411706"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Bart\u0142omiej Przybylski","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Uniwersytetu Pozna\u0144skiego 4, 61-614, Pozna\u0144, Poland"],"raw_orcid":"https://orcid.org/0000-0001-8283-7872","affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Uniwersytetu Pozna\u0144skiego 4, 61-614, Pozna\u0144, Poland","institution_ids":["https://openalex.org/I59411706"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072636624"],"corresponding_institution_ids":["https://openalex.org/I59411706"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.4529,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70923554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"44","issue":"1","first_page":"207","last_page":"222"},"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.9980999827384949,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9955999851226807,"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/computer-science","display_name":"Computer science","score":0.6634262204170227},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6366933584213257},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5905365943908691},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5535465478897095},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5241299271583557},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5212414860725403},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.467441201210022},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4624145030975342},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4502234160900116},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43496280908584595},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4279758632183075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3469502329826355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26167717576026917},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09622001647949219},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.057931989431381226}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6634262204170227},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6366933584213257},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5905365943908691},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5535465478897095},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5241299271583557},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5212414860725403},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.467441201210022},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4624145030975342},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4502234160900116},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43496280908584595},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4279758632183075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3469502329826355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26167717576026917},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09622001647949219},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.057931989431381226},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-021-00821-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-021-00821-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-021-00821-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00821-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-021-00821-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-021-00821-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-021-00821-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-021-00821-2.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6200000047683716,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3205966826.pdf","grobid_xml":"https://content.openalex.org/works/W3205966826.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1548540712","https://openalex.org/W1576373160","https://openalex.org/W1968458999","https://openalex.org/W1968886089","https://openalex.org/W1975766702","https://openalex.org/W1983974888","https://openalex.org/W1987868985","https://openalex.org/W2003079985","https://openalex.org/W2013170874","https://openalex.org/W2013936611","https://openalex.org/W2031612682","https://openalex.org/W2074948912","https://openalex.org/W2081908687","https://openalex.org/W2084224084","https://openalex.org/W2089906373","https://openalex.org/W2102201348","https://openalex.org/W2111639937","https://openalex.org/W2150094293","https://openalex.org/W2463480808","https://openalex.org/W2476974423","https://openalex.org/W2516825788","https://openalex.org/W2538372929","https://openalex.org/W2738004730","https://openalex.org/W2777830090","https://openalex.org/W2783116710","https://openalex.org/W2798842672","https://openalex.org/W2976893411","https://openalex.org/W2981903012","https://openalex.org/W3005580261","https://openalex.org/W3034470636","https://openalex.org/W3148977082","https://openalex.org/W4236796530"],"related_works":["https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W1966261337","https://openalex.org/W2074319831","https://openalex.org/W2060500675","https://openalex.org/W2094800167","https://openalex.org/W2898780166","https://openalex.org/W2041682173","https://openalex.org/W2383692867","https://openalex.org/W1971979548"],"abstract_inverted_index":{"Abstract":[0],"We":[1,76,93],"consider":[2],"a":[3,36,49,61,78],"number":[4],"of":[5,20,30,67,81,87,99],"parallel-machine":[6],"scheduling":[7],"problems":[8],"in":[9,106],"which":[10],"jobs":[11,88,101],"have":[12],"variable":[13],"processing":[14,18],"times.":[15],"The":[16],"actual":[17],"time":[19,70],"each":[21],"job":[22,47,52],"is":[23,58],"described":[24],"by":[25],"an":[26],"arbitrary":[27],"positive":[28],"function":[29,40],"the":[31,39,46,65,72,85,97],"position":[32],"it":[33],"holds":[34],"on":[35,45],"machine.":[37],"However,":[38],"itself":[41],"may":[42,102],"additionally":[43],"depend":[44],"or":[48,71],"machine":[50],"this":[51],"was":[53],"assigned":[54],"to.":[55],"Our":[56],"aim":[57],"to":[59],"find":[60],"schedule":[62],"that":[63,96],"minimizes":[64],"objectives":[66],"maximum":[68],"completion":[69,74],"total":[73],"time.":[75],"present":[77],"full":[79],"set":[80],"polynomial":[82,110],"solutions":[83],"for":[84],"cases":[86],"with":[89],"no":[90],"precedence":[91],"constraints.":[92],"also":[94],"show":[95],"case":[98],"single-chained":[100],"be":[103,113],"not":[104],"easier":[105],"general,":[107],"but":[108],"some":[109],"results":[111],"can":[112],"obtained,":[114],"too.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}