{"id":"https://openalex.org/W2003015974","doi":"https://doi.org/10.1016/0166-218x(93)90176-o","title":"Solving makespan minimization problems with Lagrangean decomposition","display_name":"Solving makespan minimization problems with Lagrangean decomposition","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W2003015974","doi":"https://doi.org/10.1016/0166-218x(93)90176-o","mag":"2003015974"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(93)90176-o","doi":"https://doi.org/10.1016/0166-218x(93)90176-o","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90176-o","pdf_url":"https://www.sciencedirect.com/science/article/pii/0166218X9390176O/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-2","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/0166218X9390176O/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021321550","display_name":"Monique Guignard","orcid":"https://orcid.org/0000-0003-4084-434X","observed_orcids":["https://orcid.org/0000-0003-4084-434X"]},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Monique Guignard","raw_affiliation_strings":["Department of Decision Sciences, University of Pennsylvania, 1320 SH-DH, Philadelphia, PA 19104-6366, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Decision Sciences, University of Pennsylvania, 1320 SH-DH, Philadelphia, PA 19104-6366, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021321550"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":1.4168,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.84192327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"42","issue":"1","first_page":"17","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9833999872207642,"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.9833999872207642,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0019000000320374966,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.0017000000225380063,"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/makespan-minimization","display_name":"makespan minimization","score":0.9980000257492065},{"id":"https://openalex.org/keywords/lagrangean-decomposition","display_name":"Lagrangean decomposition","score":0.9309999942779541},{"id":"https://openalex.org/keywords/parallel-machine-scheduling","display_name":"parallel machine scheduling","score":0.7710000276565552},{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.9120000004768372},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.6389999985694885}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7570017576217651},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7152734994888306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.688930094242096},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6611701846122742},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6419354677200317},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5971238613128662},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5791317224502563},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5590201616287231},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.46525317430496216},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.453254759311676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25558656454086304},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08517274260520935},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0166-218x(93)90176-o","doi":"https://doi.org/10.1016/0166-218x(93)90176-o","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90176-o","pdf_url":"https://www.sciencedirect.com/science/article/pii/0166218X9390176O/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-2","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/0166-218x(93)90176-o","doi":"https://doi.org/10.1016/0166-218x(93)90176-o","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0166-218x(93)90176-o","pdf_url":"https://www.sciencedirect.com/science/article/pii/0166218X9390176O/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-2","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/8","score":0.699999988079071,"display_name":"Decent work and economic growth"}],"study_designs":[],"awards":[{"id":"https://openalex.org/G6938500787","display_name":"A New Approach to Ralaxation in Integer Programming","funder_award_id":"8508142","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2003015974.pdf","grobid_xml":"https://content.openalex.org/works/W2003015974.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2468321705"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W1521824362","https://openalex.org/W2468477307","https://openalex.org/W2168163332","https://openalex.org/W1974309933","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W2074319831"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,45],"minimizing":[3],"makespan":[4],"in":[5],"a":[6],"single":[7],"stage":[8],"manufacturing":[9],"process":[10],"with":[11],"parallel":[12],"machines":[13],"and":[14,33],"multiple":[15],"job":[16,31],"types":[17,32],"can":[18,81],"be":[19,83],"decomposed":[20],"into":[21],"as":[22,28,34,40,65,67],"many":[23,35],"simple":[24],"plant":[25],"location":[26],"problems":[27,39],"there":[29,41],"are":[30,42],"constrained":[36],"0\u20131":[37],"knapsack":[38],"machines.":[43],"None":[44],"these":[46],"subproblems":[47],"has":[48],"the":[49,53,61,68,79],"integrality":[50],"property,":[51],"therefore":[52],"Lagrangean":[54,70],"dual":[55],"bound":[56,64,80],"obtained":[57],"is":[58],"stronger":[59],"than":[60],"LP":[62],"relaxation":[63,71],"well":[66],"associated":[69],"bounds.":[72],"We":[73],"show":[74],"on":[75],"an":[76],"example":[77],"that":[78],"indeed":[82],"stronger.":[84]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-09-09T07:26:56.047234","created_date":"2025-10-10T00:00:00"}