{"id":"https://openalex.org/W1999298971","doi":"https://doi.org/10.1057/palgrave.jors.2601025","title":"Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability","display_name":"Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1999298971","doi":"https://doi.org/10.1057/palgrave.jors.2601025","mag":"1999298971"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601025","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601025","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":null,"display_name":"M-L Espinouse","orcid":null},"institutions":[{"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":"M-L Espinouse","raw_affiliation_strings":["LOSI, Universit\u00e9 de Technologie de Troyes France"],"affiliations":[{"raw_affiliation_string":"LOSI, Universit\u00e9 de Technologie de Troyes France","institution_ids":["https://openalex.org/I140494188"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054092040","display_name":"Piotr Formanowicz","orcid":"https://orcid.org/0000-0003-2719-3677"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"P Formanowicz","raw_affiliation_strings":["Pozna\u0144 University of Technology Poland"],"affiliations":[{"raw_affiliation_string":"Pozna\u0144 University of Technology Poland","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086298304","display_name":"Bernard Penz","orcid":"https://orcid.org/0000-0002-2375-9349"},"institutions":[{"id":"https://openalex.org/I113194307","display_name":"Royal College of Obstetricians and Gynaecologists","ror":"https://ror.org/01bzmq497","country_code":"GB","type":"education","lineage":["https://openalex.org/I113194307"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"B Penz","raw_affiliation_strings":["GILCO, ENSGI-INPG France","GILCO, ENSGI-INPG, France"],"affiliations":[{"raw_affiliation_string":"GILCO, ENSGI-INPG France","institution_ids":["https://openalex.org/I113194307"]},{"raw_affiliation_string":"GILCO, ENSGI-INPG, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I140494188"],"apc_list":null,"apc_paid":null,"fwci":1.1851,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.8013245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"52","issue":"1","first_page":"116","last_page":"121"},"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.9976000189781189,"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.9911999702453613,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.7695094347000122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6762654781341553},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5553610324859619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5441163778305054},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5304398536682129},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.446593701839447},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3674269914627075},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3403121829032898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2925283908843994},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17090073227882385},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07889896631240845}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7695094347000122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6762654781341553},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5553610324859619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5441163778305054},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5304398536682129},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.446593701839447},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3674269914627075},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3403121829032898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2925283908843994},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17090073227882385},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07889896631240845},{"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.2601025","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601025","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:52:y:2001:i:1:d:10.1057_palgrave.jors.2601025","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601025","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971197618","https://openalex.org/W1972819258","https://openalex.org/W1983471329","https://openalex.org/W1994566591","https://openalex.org/W1995313677","https://openalex.org/W2001570418","https://openalex.org/W2024085737","https://openalex.org/W2044060832","https://openalex.org/W2063400071","https://openalex.org/W2071126781","https://openalex.org/W2149884725","https://openalex.org/W4300894845"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","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/W2140584489"],"abstract_inverted_index":{"The":[0,50],"scheduling":[1],"problems":[2],"studied":[3],"in":[4,48,80],"this":[5,19],"paper":[6],"concern":[7],"a":[8],"two-machine":[9],"no-wait":[10],"flow":[11],"shop":[12],"problem":[13,64],"with":[14,95],"limited":[15],"machine":[16],"availability.":[17],"In":[18],"model,":[20],"we":[21],"assume":[22],"that":[23,62],"machines":[24],"may":[25],"not":[26],"always":[27],"be":[28],"available,":[29],"for":[30,84],"example":[31],"because":[32],"of":[33,76,87],"preventive":[34],"maintenance.":[35],"We":[36,60,90],"only":[37,69],"consider":[38],"the":[39,43,55,63,81],"deterministic":[40],"case":[41],"where":[42],"unavailable":[44],"periods":[45],"are":[46],"known":[47],"advance.":[49],"objective":[51],"function":[52],"considered":[53],"is":[54,65],"maximum":[56],"completion":[57],"time":[58],"(Cmax).":[59],"prove":[61],"NP-hard":[66,79],"even":[67],"if":[68],"one":[70,75],"non-availability":[71,88],"period":[72],"occurs":[73],"on":[74],"machines,":[77],"and":[78],"strong":[82],"sense":[83],"arbitrary":[85],"numbers":[86],"periods.":[89],"also":[91],"provide":[92],"heuristic":[93],"algorithms":[94],"error":[96],"bounding":[97],"analysis.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}