{"id":"https://openalex.org/W2008255149","doi":"https://doi.org/10.1016/j.aci.2014.02.003","title":"A solution procedure for preemptive multi-mode project scheduling problem with mode changeability to resumption","display_name":"A solution procedure for preemptive multi-mode project scheduling problem with mode changeability to resumption","publication_year":2014,"publication_date":"2014-03-07","ids":{"openalex":"https://openalex.org/W2008255149","doi":"https://doi.org/10.1016/j.aci.2014.02.003","mag":"2008255149"},"language":"en","primary_location":{"id":"doi:10.1016/j.aci.2014.02.003","doi":"https://doi.org/10.1016/j.aci.2014.02.003","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.aci.2014.02.003","pdf_url":"https://www.sciencedirect.com/science/article/pii/S2210832714000052/pdf","source":{"id":"https://openalex.org/S2737635154","display_name":"Applied Computing and Informatics","issn_l":"2210-8327","issn":["2210-8327","2634-1964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-b","norway-1","poland-20","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Computing and Informatics","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sciencedirect.com/science/article/pii/S2210832714000052/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008945114","display_name":"Behrouz Afshar-Nadjafi","orcid":"https://orcid.org/0000-0002-3391-8411","observed_orcids":["https://orcid.org/0000-0002-3391-8411","https://orcid.org/0000-0002-1699-1553"]},"institutions":[{"id":"https://openalex.org/I197220011","display_name":"Qazvin Islamic Azad University","ror":"https://ror.org/023kjn321","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I197220011"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Behrouz Afshar-Nadjafi","raw_affiliation_strings":["Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, P.O. Box: 34185-1416, Qazvin, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, P.O. Box: 34185-1416, Qazvin, Iran","institution_ids":["https://openalex.org/I197220011"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008945114"],"corresponding_institution_ids":["https://openalex.org/I197220011"],"apc_list":null,"apc_paid":null,"fwci":1.2633,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.82569485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"2","first_page":"192","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.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/T10395","display_name":"Construction Project Management and Performance","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preemptive-scheduling","display_name":"preemptive scheduling","score":0.8309999704360962},{"id":"https://openalex.org/keywords/multi-mode-resource-constrained-project-scheduling","display_name":"multi-mode resource-constrained project scheduling","score":0.9160000085830688},{"id":"https://openalex.org/keywords/resumption","display_name":"resumption","score":0.5090000033378601},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9769999980926514},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.8420000076293945},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.8190000057220459}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7821456789970398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7449327707290649},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.651116132736206},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6430373191833496},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6419619917869568},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5070738792419434},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47805339097976685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30896466970443726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15687406063079834},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.14357084035873413},{"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.1016/j.aci.2014.02.003","doi":"https://doi.org/10.1016/j.aci.2014.02.003","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.aci.2014.02.003","pdf_url":"https://www.sciencedirect.com/science/article/pii/S2210832714000052/pdf","source":{"id":"https://openalex.org/S2737635154","display_name":"Applied Computing and Informatics","issn_l":"2210-8327","issn":["2210-8327","2634-1964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-b","norway-1","poland-20","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Computing and Informatics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a299b008c51b44328f21fe53571b085a","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/a299b008c51b44328f21fe53571b085a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Computing and Informatics, Vol 14, Iss 2, Pp 192-201 (2018)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1016/j.aci.2014.02.003","doi":"https://doi.org/10.1016/j.aci.2014.02.003","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.aci.2014.02.003","pdf_url":"https://www.sciencedirect.com/science/article/pii/S2210832714000052/pdf","source":{"id":"https://openalex.org/S2737635154","display_name":"Applied Computing and Informatics","issn_l":"2210-8327","issn":["2210-8327","2634-1964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-b","norway-1","poland-20","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Applied Computing and Informatics","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2008255149.pdf","grobid_xml":"https://content.openalex.org/works/W2008255149.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W38287544","https://openalex.org/W85289681","https://openalex.org/W109434089","https://openalex.org/W620587418","https://openalex.org/W1588020177","https://openalex.org/W1969874447","https://openalex.org/W1970451433","https://openalex.org/W1974281555","https://openalex.org/W1979627836","https://openalex.org/W1980716261","https://openalex.org/W1985909617","https://openalex.org/W1989154340","https://openalex.org/W1995131193","https://openalex.org/W1996194818","https://openalex.org/W1996721980","https://openalex.org/W2014625519","https://openalex.org/W2020044608","https://openalex.org/W2021285519","https://openalex.org/W2022632482","https://openalex.org/W2024060531","https://openalex.org/W2024742034","https://openalex.org/W2034617747","https://openalex.org/W2037993354","https://openalex.org/W2039653861","https://openalex.org/W2040610035","https://openalex.org/W2041456351","https://openalex.org/W2042486704","https://openalex.org/W2043339087","https://openalex.org/W2047422346","https://openalex.org/W2052334377","https://openalex.org/W2055522783","https://openalex.org/W2065515777","https://openalex.org/W2066447358","https://openalex.org/W2067462952","https://openalex.org/W2070891082","https://openalex.org/W2071907541","https://openalex.org/W2075585298","https://openalex.org/W2089891370","https://openalex.org/W2091648513","https://openalex.org/W2095326093","https://openalex.org/W2095332973","https://openalex.org/W2096038875","https://openalex.org/W2117837254","https://openalex.org/W2121852392","https://openalex.org/W2138543065","https://openalex.org/W2140742285","https://openalex.org/W2148108962","https://openalex.org/W2152999180","https://openalex.org/W2229528719","https://openalex.org/W2296031483","https://openalex.org/W2484725964","https://openalex.org/W2889124259","https://openalex.org/W3173754340","https://openalex.org/W4231166247","https://openalex.org/W4239600669","https://openalex.org/W4298344096","https://openalex.org/W7066341847"],"related_works":["https://openalex.org/W2183661111","https://openalex.org/W4408180986","https://openalex.org/W4411802974","https://openalex.org/W7096457136","https://openalex.org/W2912060606","https://openalex.org/W2626722727","https://openalex.org/W2065515777","https://openalex.org/W272530872","https://openalex.org/W2152999180","https://openalex.org/W2554889344"],"abstract_inverted_index":{"Extensive":[0],"research":[1],"has":[2,17],"been":[3,18],"devoted":[4],"to":[5,20,38,44,88,95,157],"the":[6,29,40,74,90,110,125,137,149,159,163],"multi-mode":[7,31,60],"resource":[8,32,61],"constrained":[9,33,62],"project":[10,34,41,63],"scheduling":[11,35,64],"problem":[12,36,50,77],"(MRCPSP).":[13],"However,":[14],"little":[15],"attention":[16],"paid":[19],"problems":[21,118],"where":[22],"preemption":[23],"is":[24,51,71,82,113,140,146,154],"allowed.":[25],"This":[26,49],"paper":[27],"involves":[28],"preemptive":[30],"(P-MRCPSP)":[37],"minimize":[39],"makespan":[42,161],"subject":[43],"mode":[45,152],"changeability":[46],"after":[47],"preemption.":[48],"a":[52,97,104],"more":[53],"realistic":[54],"model":[55],"and":[56,128,142],"extended":[57],"case":[58],"of":[59,109,124,162],"problem.":[65,75],"A":[66],"binary":[67],"integer":[68],"programing":[69],"formulation":[70],"proposed":[72,111,138],"for":[73],"The":[76,107,131],"formed":[78],"in":[79,122],"this":[80],"way":[81],"an":[83],"NP-hard":[84],"one":[85],"forcing":[86],"us":[87],"use":[89],"Simulated":[91],"Annealing":[92],"(SA)":[93],"algorithm":[94,112,139],"obtain":[96],"global":[98],"optimum":[99],"solution":[100],"or":[101],"at":[102],"least":[103],"satisfying":[105],"one.":[106],"performance":[108],"evaluated":[114],"on":[115],"480":[116],"test":[117],"by":[119],"statistically":[120],"comparing":[121],"term":[123],"objective":[126],"function":[127],"computational":[129,133],"times.":[130],"obtained":[132],"results":[134,150],"indicate":[135],"that":[136,151],"efficient":[141],"effective.":[143],"Also,":[144],"it":[145],"concluded":[147],"from":[148],"change":[153],"very":[155],"effective":[156],"improve":[158],"optimal":[160],"project.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}