{"id":"https://openalex.org/W2768622058","doi":"https://doi.org/10.1109/codit.2017.8102675","title":"A branch-and-bound algorithm for the two-machine flow-shop problem with time delays","display_name":"A branch-and-bound algorithm for the two-machine flow-shop problem with time delays","publication_year":2017,"publication_date":"2017-04-01","ids":{"openalex":"https://openalex.org/W2768622058","doi":"https://doi.org/10.1109/codit.2017.8102675","mag":"2768622058"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2017.8102675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-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/A5083099392","display_name":"Mohamed Amine Mkadem","orcid":"https://orcid.org/0000-0002-9482-278X"},"institutions":[{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I102516824","display_name":"Universit\u00e9 de Technologie de Compi\u00e8gne","ror":"https://ror.org/04y5kwa70","country_code":"FR","type":"education","lineage":["https://openalex.org/I102516824"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mohamed Amine Mkadem","raw_affiliation_strings":["CNRS, Universit\u00e9 de technologie de Compi\u00e9gne","Heudiasyc -\n        Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne]"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de technologie de Compi\u00e9gne","institution_ids":["https://openalex.org/I102516824"]},{"raw_affiliation_string":"Heudiasyc -\n        Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne]","institution_ids":["https://openalex.org/I4210088387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014060007","display_name":"Aziz Moukrim","orcid":"https://orcid.org/0000-0003-0151-6327"},"institutions":[{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I102516824","display_name":"Universit\u00e9 de Technologie de Compi\u00e8gne","ror":"https://ror.org/04y5kwa70","country_code":"FR","type":"education","lineage":["https://openalex.org/I102516824"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aziz Moukrim","raw_affiliation_strings":["CNRS, Universit\u00e9 de technologie de Compi\u00e9gne","Labex MS2T -\n        Laboratoire d'Excellence \"Ma\u00eetrise des Syst\u00e8mes de Syst\u00e8mes Technologiques\"","Heudiasyc -\n        Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne]"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de technologie de Compi\u00e9gne","institution_ids":["https://openalex.org/I102516824"]},{"raw_affiliation_string":"Labex MS2T -\n        Laboratoire d'Excellence \"Ma\u00eetrise des Syst\u00e8mes de Syst\u00e8mes Technologiques\"","institution_ids":[]},{"raw_affiliation_string":"Heudiasyc -\n        Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne]","institution_ids":["https://openalex.org/I4210088387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060984191","display_name":"Mehdi Serairi","orcid":"https://orcid.org/0000-0001-7694-601X"},"institutions":[{"id":"https://openalex.org/I102516824","display_name":"Universit\u00e9 de Technologie de Compi\u00e8gne","ror":"https://ror.org/04y5kwa70","country_code":"FR","type":"education","lineage":["https://openalex.org/I102516824"]},{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mehdi Serairi","raw_affiliation_strings":["CNRS, Universit\u00e9 de technologie de Compi\u00e9gne","Labex MS2T -\n        Laboratoire d'Excellence \"Ma\u00eetrise des Syst\u00e8mes de Syst\u00e8mes Technologiques\"","Heudiasyc -\n        Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne]"],"affiliations":[{"raw_affiliation_string":"CNRS, Universit\u00e9 de technologie de Compi\u00e9gne","institution_ids":["https://openalex.org/I102516824"]},{"raw_affiliation_string":"Labex MS2T -\n        Laboratoire d'Excellence \"Ma\u00eetrise des Syst\u00e8mes de Syst\u00e8mes Technologiques\"","institution_ids":[]},{"raw_affiliation_string":"Heudiasyc -\n        Heuristique et Diagnostic des Syst\u00e8mes Complexes [Compi\u00e8gne]","institution_ids":["https://openalex.org/I4210088387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083099392"],"corresponding_institution_ids":["https://openalex.org/I102516824","https://openalex.org/I4210088387"],"apc_list":null,"apc_paid":null,"fwci":0.3011,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67150181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"0690","last_page":"0695"},"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.9983000159263611,"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.995199978351593,"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/branch-and-bound","display_name":"Branch and bound","score":0.8281806111335754},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.7553104162216187},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7374538779258728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6473467946052551},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6337786912918091},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5576768517494202},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5568898320198059},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.528156042098999},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4696848690509796},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4514238238334656},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45021137595176697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2331787347793579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11497631669044495},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07861411571502686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.07559964060783386}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.8281806111335754},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.7553104162216187},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7374538779258728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6473467946052551},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6337786912918091},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5576768517494202},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5568898320198059},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.528156042098999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4696848690509796},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4514238238334656},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45021137595176697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2331787347793579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11497631669044495},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07861411571502686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07559964060783386},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit.2017.8102675","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01551056v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01551056","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":"http://ieeexplore.ieee.org/document/8102675/","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338463","display_name":"CHIST-ERA","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1583233220","https://openalex.org/W2006110445","https://openalex.org/W2024085737","https://openalex.org/W2041252124","https://openalex.org/W2051370696","https://openalex.org/W2078664320","https://openalex.org/W2121217029","https://openalex.org/W2160610679","https://openalex.org/W2337098327","https://openalex.org/W4299127953"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"We":[0,23],"address":[1],"the":[2,16,19,58,80,83],"flow-shop":[3],"scheduling":[4],"problem":[5],"with":[6],"two":[7],"machines":[8],"and":[9,47],"time":[10],"delays":[11],"in":[12],"order":[13],"to":[14],"minimize":[15],"makespan,":[17],"i.e,":[18],"maximum":[20],"completion":[21],"time.":[22],"propose":[24],"an":[25],"exact":[26,85],"algorithm":[27],"based":[28,41],"on":[29,42,65],"a":[30,38,43,54,66],"branch-and-bound":[31,59],"enumeration":[32],"scheme,":[33],"for":[34],"which":[35,61],"we":[36,52],"introduce":[37],"heuristic":[39],"method":[40,78],"local":[44],"search":[45],"technique":[46],"three":[48],"dominance":[49],"rules.":[50],"Finally,":[51],"present":[53],"computer":[55],"simulation":[56],"of":[57,68,82],"algorithm,":[60],"was":[62],"carried":[63],"out":[64],"set":[67],"360":[69],"instances.":[70],"The":[71],"results":[72],"show":[73],"that":[74],"our":[75],"branch-":[76],"and-bound":[77],"outperforms":[79],"state":[81],"art":[84],"method.":[86]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}