{"id":"https://openalex.org/W2759453454","doi":"https://doi.org/10.1080/00207543.2017.1378828","title":"Productivity improvement through a sequencing generalised assignment in an assembly line system","display_name":"Productivity improvement through a sequencing generalised assignment in an assembly line system","publication_year":2017,"publication_date":"2017-09-25","ids":{"openalex":"https://openalex.org/W2759453454","doi":"https://doi.org/10.1080/00207543.2017.1378828","mag":"2759453454"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2017.1378828","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2017.1378828","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,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"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"},"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/A5071023738","display_name":"S.E. Moussavi","orcid":"https://orcid.org/0000-0002-4601-6580"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Seyed-Esmaeil Moussavi","raw_affiliation_strings":["Nanomedicine lab, Univ. Bourgogne Franche-Comt\u00e9, UTBM, Belfort, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanomedicine lab, Univ. Bourgogne Franche-Comt\u00e9, UTBM, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018842516","display_name":"Morad Mahdjoub","orcid":"https://orcid.org/0000-0002-1199-7497"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Morad Mahdjoub","raw_affiliation_strings":["ELLIADD Lab, Univ. Bourgogne Franche-Comt\u00e9, UTBM, Montb\u00e9liard, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ELLIADD Lab, Univ. Bourgogne Franche-Comt\u00e9, UTBM, Montb\u00e9liard, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074208099","display_name":"Olivier Grunder","orcid":"https://orcid.org/0000-0003-1726-1576"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Olivier Grunder","raw_affiliation_strings":["Nanomedicine lab, Univ. Bourgogne Franche-Comt\u00e9, UTBM, Belfort, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanomedicine lab, Univ. Bourgogne Franche-Comt\u00e9, UTBM, Belfort, France","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071023738"],"corresponding_institution_ids":["https://openalex.org/I37553959"],"apc_list":null,"apc_paid":null,"fwci":2.6707,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90974861,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"55","issue":"24","first_page":"7509","last_page":"7523"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9998999834060669,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9908000230789185,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9876000285148621,"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/solver","display_name":"Solver","score":0.7575961947441101},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7517857551574707},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.7148537635803223},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.6803736090660095},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6664386987686157},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5441778898239136},{"id":"https://openalex.org/keywords/linear-bottleneck-assignment-problem","display_name":"Linear bottleneck assignment problem","score":0.5440657734870911},{"id":"https://openalex.org/keywords/workstation","display_name":"Workstation","score":0.5338742733001709},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5087886452674866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5052939057350159},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4974389374256134},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4714086055755615},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4314875602722168},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4191184937953949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3035932779312134}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7575961947441101},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7517857551574707},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.7148537635803223},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.6803736090660095},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6664386987686157},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5441778898239136},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.5440657734870911},{"id":"https://openalex.org/C67953723","wikidata":"https://www.wikidata.org/wiki/Q192525","display_name":"Workstation","level":2,"score":0.5338742733001709},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5087886452674866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5052939057350159},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4974389374256134},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4714086055755615},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4314875602722168},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4191184937953949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3035932779312134},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/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.1080/00207543.2017.1378828","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2017.1378828","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,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"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"},{"id":"pmh:oai:HAL:hal-03128166v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-03128166","pdf_url":null,"source":{"id":"https://openalex.org/S4406922276","display_name":"INRIA a CCSD electronic archive server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0020-7543","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-03162606v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03162606","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Production Research, 2017, 55 (24), pp.7509-7523. ⟨10.1080/00207543.2017.1378828⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:55:y:2017:i:24:p:7509-7523","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2017.1378828","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":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6600000262260437}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W56687990","https://openalex.org/W1964413087","https://openalex.org/W1975167882","https://openalex.org/W1978264569","https://openalex.org/W1979872043","https://openalex.org/W1983219414","https://openalex.org/W1987400245","https://openalex.org/W1990479938","https://openalex.org/W1993062444","https://openalex.org/W2000504331","https://openalex.org/W2001123864","https://openalex.org/W2014369282","https://openalex.org/W2014617308","https://openalex.org/W2020030076","https://openalex.org/W2027286092","https://openalex.org/W2033791397","https://openalex.org/W2058233069","https://openalex.org/W2058985100","https://openalex.org/W2059961050","https://openalex.org/W2062718129","https://openalex.org/W2072270250","https://openalex.org/W2076059734","https://openalex.org/W2086163307","https://openalex.org/W2090758824","https://openalex.org/W2147336456","https://openalex.org/W2158760370","https://openalex.org/W2192972627","https://openalex.org/W2475526082","https://openalex.org/W2514757504","https://openalex.org/W2528746313","https://openalex.org/W4300766842"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W2113934189","https://openalex.org/W2011647332","https://openalex.org/W1586515950","https://openalex.org/W3149825000","https://openalex.org/W4287244800","https://openalex.org/W2760584304","https://openalex.org/W2382974548","https://openalex.org/W2311097448","https://openalex.org/W4212780071"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,18,23,26,32,40,75,96,126,132,142,151,162,168,178,183,202,205,209,215],"assignment":[4,48,77,109,172],"of":[5,10,25,31,66,74,80,83,154,182,196,204,214],"heterogeneous":[6],"workers":[7],"to":[8,16,54],"workstations":[9,33],"an":[11,56,72,116],"assembly":[12],"line":[13],"in":[14,90,208],"order":[15],"minimise":[17],"total":[19,195],"production":[20],"time.":[21],"As":[22],"structure":[24],"system":[27],"implies":[28],"that":[29,125],"each":[30,87,92],"needs":[34],"at":[35],"least":[36],"one":[37],"worker,":[38],"thus":[39],"problem":[41,49,127,163,179,184],"can":[42],"be":[43],"considered":[44],"as":[45,167],"a":[46,62,81,194],"generalised":[47,76],"(GAP).":[50],"The":[51,111,158,174,189,199],"objective":[52],"is":[53,104,113,123,128,138],"perform":[55],"efficient":[57],"human":[58],"resource":[59],"planning":[60,88],"for":[61,86,106],"specified":[63],"horizon":[64],"consisting":[65,79],"several":[67,186],"periods.":[68],"Hence,":[69,145],"we":[70],"present":[71],"extension":[73],"problem,":[78],"set":[82],"GAPs":[84],"(one":[85],"period)":[89],"which":[91],"GAP":[93,155],"depends":[94],"on":[95,150],"previous":[97],"ones.":[98],"A":[99],"mixed":[100],"integer":[101],"mathematical":[102],"model":[103,112],"presented":[105],"this":[107],"sequencing":[108],"problem.":[110],"solved":[114],"by":[115,141,180,193],"exact":[117,143],"algorithm":[118],"using":[119],"Gurobi":[120],"solver.":[121],"It":[122],"proved":[124],"NP-hard":[129],"and":[130,134,171,212],"solving":[131],"medium":[133],"large":[135],"size":[136],"instances":[137],"not":[139],"possible":[140],"algorithms.":[144],"two":[146,165],"matheuristic":[147],"approaches":[148,190],"based":[149],"disaggregated":[152],"formulation":[153,170],"are":[156,191],"proposed.":[157],"first":[159],"approach":[160,176],"solves":[161,177],"through":[164],"sub-problems":[166],"transportation":[169],"formulation.":[173],"second":[175],"decomposition":[181],"into":[185],"classical":[187],"GAPs.":[188],"examined":[192],"27":[197],"instances.":[198],"results":[200],"illustrate":[201],"efficiency":[203],"proposed":[206],"algorithms":[207],"computational":[210],"time":[211],"accuracy":[213],"solutions.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}