{"id":"https://openalex.org/W2101937070","doi":"https://doi.org/10.1007/s10107-006-0059-3","title":"Machine scheduling with resource dependent processing times","display_name":"Machine scheduling with resource dependent processing times","publication_year":2006,"publication_date":"2006-12-11","ids":{"openalex":"https://openalex.org/W2101937070","doi":"https://doi.org/10.1007/s10107-006-0059-3","mag":"2101937070"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-006-0059-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-006-0059-3","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5052039079","display_name":"Alexander Grigoriev","orcid":"https://orcid.org/0000-0002-8391-235X"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexander Grigoriev","raw_affiliation_strings":["Quantitative Economics, Maastricht University, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","Maastricht University, Quantitative Economics, P.O. Box 616, 6200, Maastricht, MD, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Quantitative Economics, Maastricht University, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Maastricht University, Quantitative Economics, P.O. Box 616, 6200, Maastricht, MD, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim Sviridenko","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":["IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, USA","IBM, T. J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM, T. J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052226987","display_name":"Marc Uetz","orcid":"https://orcid.org/0000-0003-4223-2435"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marc Uetz","raw_affiliation_strings":["Quantitative Economics, Maastricht University, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","Maastricht University, Quantitative Economics, P.O. Box 616, 6200, Maastricht, MD, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Quantitative Economics, Maastricht University, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Maastricht University, Quantitative Economics, P.O. Box 616, 6200, Maastricht, MD, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.7397,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.95425543,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"110","issue":"1","first_page":"209","last_page":"228"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"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.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8352686166763306},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7144500613212585},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6566554307937622},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6418453454971313},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6353152394294739},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5719764828681946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5690223574638367},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5540784001350403},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.49799060821533203},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.484355092048645},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.46282702684402466},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.4537504017353058},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.41060927510261536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3957858085632324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.349179208278656},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.32721465826034546},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.21191078424453735}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8352686166763306},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7144500613212585},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6566554307937622},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6418453454971313},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6353152394294739},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5719764828681946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5690223574638367},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5540784001350403},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49799060821533203},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.484355092048645},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46282702684402466},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.4537504017353058},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.41060927510261536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3957858085632324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.349179208278656},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.32721465826034546},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.21191078424453735},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-006-0059-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-006-0059-3","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/daf683e6-af47-47b0-b569-f2de9ba4f897","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/daf683e6-af47-47b0-b569-f2de9ba4f897","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Grigoriev, A, Sviridenko, M & Uetz, M J 2007, 'Machine Scheduling with Resource Dependent Processing Times', Mathematical Programming, vol. 110, no. 1, pp. 209-228. https://doi.org/10.1007/s10107-006-0059-3","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:publications/604f2d14-f79f-4fcb-b236-5e4a54c969df","is_oa":false,"landing_page_url":"http://eprints.eemcs.utwente.nl/secure2/11533/01/fulltext.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:ut:oai:ris.utwente.nl:publications/604f2d14-f79f-4fcb-b236-5e4a54c969df","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/604f2d14-f79f-4fcb-b236-5e4a54c969df","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical programming, 110(Supplement/1):10.1007/s10107-006-0059-3, 209 - 228. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1495834223","https://openalex.org/W1974787183","https://openalex.org/W1985211757","https://openalex.org/W2011039300","https://openalex.org/W2014369282","https://openalex.org/W2018125025","https://openalex.org/W2024742034","https://openalex.org/W2027544357","https://openalex.org/W2035871154","https://openalex.org/W2062621168","https://openalex.org/W2076512004","https://openalex.org/W2076760932","https://openalex.org/W2086190489","https://openalex.org/W2089269509","https://openalex.org/W2093979815","https://openalex.org/W2102201348","https://openalex.org/W2104680817","https://openalex.org/W2110819444","https://openalex.org/W2116636977","https://openalex.org/W2137652805","https://openalex.org/W2139411793","https://openalex.org/W2144110390","https://openalex.org/W2144416612","https://openalex.org/W2644831379","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W2561769964","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2035016254","https://openalex.org/W1978147206","https://openalex.org/W168026201","https://openalex.org/W4287593987","https://openalex.org/W2031277014","https://openalex.org/W3112213682"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}