{"id":"https://openalex.org/W2809864723","doi":"https://doi.org/10.1080/00207543.2018.1489160","title":"Minimising the makespan in the two-machine job shop problem under availability constraints","display_name":"Minimising the makespan in the two-machine job shop problem under availability constraints","publication_year":2018,"publication_date":"2018-06-28","ids":{"openalex":"https://openalex.org/W2809864723","doi":"https://doi.org/10.1080/00207543.2018.1489160","mag":"2809864723"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2018.1489160","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1489160","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/A5083991563","display_name":"Mourad Benttaleb","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mourad Benttaleb","raw_affiliation_strings":["UMR CNRS 6281, ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMR CNRS 6281, ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021783537","display_name":"Faicel Hnaien","orcid":"https://orcid.org/0000-0002-3037-9280"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Faicel Hnaien","raw_affiliation_strings":["UMR CNRS 6281, ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMR CNRS 6281, ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079174269","display_name":"Farouk Yalaoui","orcid":"https://orcid.org/0000-0001-7360-2932"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Farouk Yalaoui","raw_affiliation_strings":["UMR CNRS 6281, ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMR CNRS 6281, ICD-LOSI, Universit\u00e9 de Technologie de Troyes, Troyes Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083991563"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I140494188"],"apc_list":null,"apc_paid":null,"fwci":1.7165,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87013767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"57","issue":"5","first_page":"1427","last_page":"1457"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9980000257492065,"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.9962000250816345,"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/unavailability","display_name":"Unavailability","score":0.8960137367248535},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8298065662384033},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6752637624740601},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6376347541809082},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5210575461387634},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.45721718668937683},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4362235367298126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2056799829006195}],"concepts":[{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.8960137367248535},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8298065662384033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6752637624740601},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6376347541809082},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5210575461387634},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.45721718668937683},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4362235367298126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2056799829006195},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/00207543.2018.1489160","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2018.1489160","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-02311035v1","is_oa":false,"landing_page_url":"https://utt.hal.science/hal-02311035","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, 2018, 57 (5), pp.1427-1457. ⟨10.1080/00207543.2018.1489160⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:57:y:2019:i:5:p:1427-1457","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2018.1489160","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":[{"score":0.7300000190734863,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1966446265","https://openalex.org/W1974874234","https://openalex.org/W1989694891","https://openalex.org/W1994566591","https://openalex.org/W1994970597","https://openalex.org/W2001080175","https://openalex.org/W2001570418","https://openalex.org/W2002455648","https://openalex.org/W2024085737","https://openalex.org/W2030047611","https://openalex.org/W2030182609","https://openalex.org/W2040303793","https://openalex.org/W2063400071","https://openalex.org/W2065819816","https://openalex.org/W2069625430","https://openalex.org/W2071126781","https://openalex.org/W2071306171","https://openalex.org/W2107656061","https://openalex.org/W2130272456","https://openalex.org/W2156391157","https://openalex.org/W2291867023","https://openalex.org/W2565296326","https://openalex.org/W2741277671","https://openalex.org/W2793943569"],"related_works":["https://openalex.org/W2587727662","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"],"abstract_inverted_index":{"Classical":[0],"scheduling":[1,10,47],"problem":[2,48],"assumes":[3],"that":[4],"machines":[5],"are":[6,66],"available":[7],"during":[8],"the":[9,58,71,96,108,111,133,139,144,147],"horizon.":[11],"This":[12],"assumption":[13],"may":[14],"be":[15,36,77],"justified":[16],"in":[17,68,87],"some":[18],"situations":[19],"but":[20],"it":[21],"does":[22],"not":[23],"apply":[24],"if":[25],"maintenance":[26],"requirements,":[27],"machine":[28,55],"breakdowns":[29],"or":[30],"other":[31],"availability":[32,51,102],"constraints":[33],"have":[34],"to":[35,56,106,131],"considered.":[37],"In":[38,104],"this":[39],"paper,":[40],"we":[41,114],"treat":[42],"a":[43,126],"two-machine":[44],"job":[45],"shop":[46],"with":[49,92],"one":[50],"constraint":[52],"on":[53],"each":[54],"minimise":[57],"maximum":[59],"completion":[60],"time":[61],"(makespan).":[62],"The":[63],"unavailability":[64,81],"periods":[65],"known":[67],"advance":[69],"and":[70,95,122,128,142],"processing":[72],"of":[73,98,110,146],"an":[74,80],"operation":[75],"cannot":[76],"interrupted":[78],"by":[79],"period":[82],"(non-preemptive":[83],"case).":[84],"We":[85],"present":[86],"our":[88],"approach":[89,141],"properties":[90],"dealing":[91],"permutation":[93],"dominance":[94],"optimality":[97],"Jackson's":[99],"rule":[100],"under":[101],"constraints.":[103],"order":[105],"evaluate":[107],"effectiveness":[109],"proposed":[112,140],"approach,":[113],"develop":[115],"two":[116,123],"mixed":[117],"integer":[118],"linear":[119],"programming":[120],"models":[121],"schemes":[124],"for":[125],"branch":[127],"bound":[129],"method":[130],"solve":[132],"tackled":[134],"problem.":[135],"Computational":[136],"results":[137],"validate":[138],"prove":[143],"efficiency":[145],"developed":[148],"methods.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}