{"id":"https://openalex.org/W1980489469","doi":"https://doi.org/10.1007/s10951-008-0098-0","title":"A Lagrangian approach to single-machine scheduling problems with two competing agents","display_name":"A Lagrangian approach to single-machine scheduling problems with two competing agents","publication_year":2009,"publication_date":"2009-01-28","ids":{"openalex":"https://openalex.org/W1980489469","doi":"https://doi.org/10.1007/s10951-008-0098-0","mag":"1980489469"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-008-0098-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-008-0098-0","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"Journal of Scheduling","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/A5030944098","display_name":"Alessandro Agnetis","orcid":"https://orcid.org/0000-0001-5803-0438"},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessandro Agnetis","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Siena, Siena, Italy","Dipartimento di Ingegner\u00efa dell\u2019Informazione Universit\u00e0 di Siena, Siena - Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Siena, Siena, Italy","institution_ids":["https://openalex.org/I102064193"]},{"raw_affiliation_string":"Dipartimento di Ingegner\u00efa dell\u2019Informazione Universit\u00e0 di Siena, Siena - Italy","institution_ids":["https://openalex.org/I102064193"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054026934","display_name":"Gianluca de Pascale","orcid":null},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluca de Pascale","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Siena, Siena, Italy","Dipartimento di Ingegner\u00efa dell\u2019Informazione Universit\u00e0 di Siena, Siena - Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Siena, Siena, Italy","institution_ids":["https://openalex.org/I102064193"]},{"raw_affiliation_string":"Dipartimento di Ingegner\u00efa dell\u2019Informazione Universit\u00e0 di Siena, Siena - Italy","institution_ids":["https://openalex.org/I102064193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034554724","display_name":"Dario Pacciarelli","orcid":"https://orcid.org/0000-0002-0020-1940"},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Dario Pacciarelli","raw_affiliation_strings":["Dipartimento di Informatica e Automazione, Universit\u00e0 Roma Tre, Roma, Italy","Dipartimento di Informatica e Automazione, Universit\u00e0 Roma Tre, Roma, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Automazione, Universit\u00e0 Roma Tre, Roma, Italy","institution_ids":["https://openalex.org/I119003972"]},{"raw_affiliation_string":"Dipartimento di Informatica e Automazione, Universit\u00e0 Roma Tre, Roma, Italy#TAB#","institution_ids":["https://openalex.org/I119003972"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030944098"],"corresponding_institution_ids":["https://openalex.org/I102064193"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":18.1444,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.99308335,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"12","issue":"4","first_page":"401","last_page":"415"},"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.9975000023841858,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.989300012588501,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.8463623523712158},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7028420567512512},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6334788799285889},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5999617576599121},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5654791593551636},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5314556360244751},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5301830172538757},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.512437641620636},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4911439120769501},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.45996859669685364},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4532202482223511},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44244900345802307},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42569056153297424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4192824363708496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27069592475891113},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.1829637885093689},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11339935660362244},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10965883731842041}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8463623523712158},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7028420567512512},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6334788799285889},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5999617576599121},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5654791593551636},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5314556360244751},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5301830172538757},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.512437641620636},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4911439120769501},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.45996859669685364},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4532202482223511},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44244900345802307},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42569056153297424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4192824363708496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27069592475891113},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.1829637885093689},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11339935660362244},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10965883731842041},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10951-008-0098-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10951-008-0098-0","pdf_url":null,"source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma3.it:11590/150224","is_oa":false,"landing_page_url":"http://hdl.handle.net/11590/150224","pdf_url":null,"source":{"id":"https://openalex.org/S4377196120","display_name":"Iris (Roma Tre University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119003972","host_organization_name":"Roma Tre University","host_organization_lineage":["https://openalex.org/I119003972"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:usiena-air.unisi.it:11365/23316","is_oa":false,"landing_page_url":"http://hdl.handle.net/11365/23316","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W42525944","https://openalex.org/W1982445253","https://openalex.org/W1987344586","https://openalex.org/W1988328380","https://openalex.org/W1992382037","https://openalex.org/W1997032351","https://openalex.org/W2008118316","https://openalex.org/W2049449905","https://openalex.org/W2074320981","https://openalex.org/W2099927590","https://openalex.org/W2138499209","https://openalex.org/W2155047985"],"related_works":["https://openalex.org/W2158042542","https://openalex.org/W3083877676","https://openalex.org/W4245896209","https://openalex.org/W2953716582","https://openalex.org/W2088339996","https://openalex.org/W2154007187","https://openalex.org/W2161433582","https://openalex.org/W1914177958","https://openalex.org/W2185461567","https://openalex.org/W2588836606"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":10}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
