{"id":"https://openalex.org/W2077749807","doi":"https://doi.org/10.1057/palgrave.jors.2601421","title":"A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint","display_name":"A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint","publication_year":2002,"publication_date":"2002-10-17","ids":{"openalex":"https://openalex.org/W2077749807","doi":"https://doi.org/10.1057/palgrave.jors.2601421","mag":"2077749807"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601421","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601421","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5097091311","display_name":"T Lorigeon","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"T Lorigeon","raw_affiliation_strings":["Universit\u00e9 de Tours Tours France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Tours Tours France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103511649","display_name":"J-C Billaut","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"J-C Billaut","raw_affiliation_strings":["Universit\u00e9 de Tours Tours France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Tours Tours France","institution_ids":["https://openalex.org/I110017253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109190413","display_name":"J-L Bouquard","orcid":null},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J-L Bouquard","raw_affiliation_strings":["Universit\u00e9 de Tours Tours France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Tours Tours France","institution_ids":["https://openalex.org/I110017253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5097091311","https://openalex.org/A5103511649"],"corresponding_institution_ids":["https://openalex.org/I110017253"],"apc_list":null,"apc_paid":null,"fwci":0.8243,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.74857618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"53","issue":"11","first_page":"1239","last_page":"1246"},"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.996399998664856,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9905999898910522,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7458540201187134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.701597273349762},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.590988278388977},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5886145830154419},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5652373433113098},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5353460907936096},{"id":"https://openalex.org/keywords/open-shop","display_name":"Open shop","score":0.5246624946594238},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5230194926261902},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4707672595977783},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4635796546936035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45165693759918213},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.42773330211639404},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4190446734428406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18313324451446533},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11044549942016602},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10951265692710876},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.06155836582183838}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7458540201187134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.701597273349762},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.590988278388977},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5886145830154419},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5652373433113098},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5353460907936096},{"id":"https://openalex.org/C2776484797","wikidata":"https://www.wikidata.org/wiki/Q7096412","display_name":"Open shop","level":5,"score":0.5246624946594238},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5230194926261902},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4707672595977783},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4635796546936035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45165693759918213},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.42773330211639404},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4190446734428406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18313324451446533},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11044549942016602},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10951265692710876},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.06155836582183838},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2601421","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601421","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:53:y:2002:i:11:d:10.1057_palgrave.jors.2601421","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601421","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.5299999713897705,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1980096819","https://openalex.org/W2002455648","https://openalex.org/W2007919031","https://openalex.org/W2024085737","https://openalex.org/W2044451514","https://openalex.org/W2046217560","https://openalex.org/W2049407747","https://openalex.org/W2065819816","https://openalex.org/W2071126781","https://openalex.org/W2093229192","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2034689541","https://openalex.org/W3094194260","https://openalex.org/W2967782293","https://openalex.org/W2011111461","https://openalex.org/W4213419954","https://openalex.org/W2114625142","https://openalex.org/W2068762498","https://openalex.org/W3149415074","https://openalex.org/W2141381612","https://openalex.org/W1564838499"],"abstract_inverted_index":{"This":[0,47],"paper":[1],"studies":[2],"a":[3,17,53,76,109],"two-machine":[4],"open":[5],"shop":[6],"scheduling":[7],"problem":[8,48,62],"with":[9,87,98],"an":[10],"availability":[11],"constraint,":[12],"ie":[13],"we":[14,74,102],"assume":[15],"that":[16,24,82,104],"machine":[18,36,66],"is":[19,49,67],"not":[20,68],"always":[21],"available":[22,38,69],"and":[23],"the":[25,28,35,42,61,65],"processing":[26],"of":[27,113],"interrupted":[29],"job":[30],"can":[31],"be":[32],"resumed":[33],"when":[34,64],"becomes":[37],"again.":[39],"We":[40,51],"consider":[41],"makespan":[43],"minimization":[44],"as":[45],"criterion.":[46],"NP-hard.":[50],"develop":[52],"pseudo-polynomial":[54],"time":[55,71],"dynamic":[56],"programming":[57,80],"algorithm":[58,107],"to":[59,84,89],"solve":[60,85],"optimally":[63,92],"at":[70],"s>0.":[72],"Then,":[73],"propose":[75],"mixed":[77],"integer":[78],"linear":[79],"formulation,":[81],"allows":[83],"instances":[86],"up":[88],"500":[90],"jobs":[91],"in":[93],"less":[94],"than":[95],"5":[96],"min":[97],"CPLEX":[99],"solver.":[100],"Finally,":[101],"show":[103],"any":[105],"heuristic":[106],"has":[108],"worst-case":[110],"error":[111],"bound":[112],"1.":[114]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2025-10-10T00:00:00"}