{"id":"https://openalex.org/W214717176","doi":null,"title":"Scheduling of Projects under Penalty and Reward Arrangements: A Mixed Integer Programming Model and Its Variants","display_name":"Scheduling of Projects under Penalty and Reward Arrangements: A Mixed Integer Programming Model and Its Variants","alternate_titles":[],"publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W214717176","mag":"214717176"},"language":"en","primary_location":{"id":"mag:214717176","doi":null,"is_oa":false,"landing_page_url":"https://www.questia.com/library/journal/1P3-2751578671/scheduling-of-projects-under-penalty-and-reward-arrangements","pdf_url":null,"source":{"id":"https://openalex.org/S2764659262","display_name":"Academy of Information and Management Sciences journal","issn_l":"1524-7252","issn":["1524-7252"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20"],"host_organization":"https://openalex.org/P4310315810","host_organization_name":"Allied Academies","host_organization_lineage":["https://openalex.org/P4310315810","https://openalex.org/P4310320466"],"host_organization_lineage_names":["Allied Academies","OMICS Publishing Group"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Academy of Information and Management Sciences journal","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W214717176"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5110941371","display_name":"Joel K. Jolayemi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Joel K. Jolayemi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5110941371"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3472,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61841291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":94},"biblio":{"volume":"15","issue":"2","first_page":"29","last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9990000128746033,"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":0.9990000128746033,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0005000000237487257,"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/T10395","display_name":"Construction Project Management and Performance","score":9.999999747378752e-05,"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/project-scheduling","display_name":"project scheduling","score":0.9929999709129333},{"id":"https://openalex.org/keywords/time-cost-trade-off","display_name":"time-cost trade-off","score":0.8989999890327454},{"id":"https://openalex.org/keywords/mixed-integer-linear-programming","display_name":"mixed-integer linear programming","score":0.7879999876022339},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.6359999775886536},{"id":"https://openalex.org/keywords/project-cost","display_name":"project cost","score":0.5929999947547913},{"id":"https://openalex.org/keywords/time-to-event","display_name":"time to event","score":0.42500001192092896},{"id":"https://openalex.org/keywords/zero-one-variables","display_name":"zero-one variables","score":0.6510000228881836},{"id":"https://openalex.org/keywords/model-variants","display_name":"model variants","score":0.5690000057220459},{"id":"https://openalex.org/keywords/project-management","display_name":"project management","score":0.421999990940094},{"id":"https://openalex.org/keywords/net-present-value","display_name":"net present value","score":0.4970000088214874},{"id":"https://openalex.org/keywords/discounted-cash-flow","display_name":"discounted cash flow","score":0.460999995470047},{"id":"https://openalex.org/keywords/time-constraints","display_name":"time constraints","score":0.3400000035762787}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6876367330551147},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6479918360710144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5854411721229553},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5670056939125061},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5377045273780823},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.4849534332752228},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4120241105556488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.307741641998291},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.10186377167701721},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:214717176","doi":null,"is_oa":false,"landing_page_url":"https://www.questia.com/library/journal/1P3-2751578671/scheduling-of-projects-under-penalty-and-reward-arrangements","pdf_url":null,"source":{"id":"https://openalex.org/S2764659262","display_name":"Academy of Information and Management Sciences journal","issn_l":"1524-7252","issn":["1524-7252"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20"],"host_organization":"https://openalex.org/P4310315810","host_organization_name":"Allied Academies","host_organization_lineage":["https://openalex.org/P4310315810","https://openalex.org/P4310320466"],"host_organization_lineage_names":["Allied Academies","OMICS Publishing Group"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Academy of Information and Management Sciences journal","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2007705051","https://openalex.org/W7055441227","https://openalex.org/W2786743500","https://openalex.org/W4391423656","https://openalex.org/W1972837869","https://openalex.org/W2283373188","https://openalex.org/W2809425660","https://openalex.org/W2759138492","https://openalex.org/W2556919757","https://openalex.org/W2086741201"],"abstract_inverted_index":{"In":[0],"this":[1,324],"paper,":[2],"we":[3],"develop":[4],"a":[5,315],"mixed":[6],"integer":[7],"linear":[8],"programming":[9],"(MILP)":[10],"model":[11,24,36,54,94,115,151,194,208,234,242,306],"for":[12,42,190,592],"scheduling":[13,43,287,337],"projects":[14,386,578],"under":[15,64,248],"penalty":[16],"and":[17,28,37,45,74,95,106,110,134,177,197,201,224,255,286,323,330,358,459,487,552,575,595,598],"reward":[18,531],"arrangements.":[19],"Two":[20],"variants":[21,26,39,55,97,116,195],"of":[22,50,52,61,86,103,132,142,162,171,184,193,205,212,239,279,317,332,335,342,344,355,361,381,385,484,490,496,507,565,567,577,589],"the":[23,53,59,62,76,87,92,99,123,137,149,160,182,191,213,225,240,277,328,497,505,572,587],"(model":[25],"I":[27,196],"II)":[29],"are":[30,40,56,67,117,188,199,347,354,492],"also":[31,503],"developed.":[32],"The":[33,48,84,114,140,210,272,339,563],"main":[34,93,124,138,150,214,241],"MILP":[35,125],"its":[38,96,172],"applicable":[41,247],"for-profit":[44,254],"not-for-profit":[46,256],"projects.":[47],"developments":[49,329,588],"each":[51,170,566],"preceded":[57],"by":[58,289],"descriptions":[60],"conditions/assumptions":[63],"which":[65,491],"they":[66,80],"applicable.":[68],"Numerical":[69],"examples":[70,88,406],"given":[71],"to":[72,120,148,154,169,327,586],"test":[73],"compare":[75],"models":[77,346],"show":[78,89],"that":[79,90,181,187,244,580],"work":[81,313],"very":[82],"well.":[83],"results":[85],"both":[91],"produce":[98],"same":[100],"optimal":[101,146,167],"values":[102],"project/activity":[104],"durations":[105],"event":[107],"times,":[108],"bonus/penalty,":[109],"total":[111],"project":[112,206,232,258,260,284,336,485],"costs.":[113],"much":[118,129,581],"easier":[119],"solve":[121],"than":[122,136,222],"model.":[126,139],"They":[127],"have":[128,502],"less":[130],"number":[131,141,161,183,211,226],"variables":[133,186,217],"constraints":[135],"iterations":[143,163],"before":[144,164],"obtaining":[145,165],"solution":[147,168],"is":[152,180,218,243,246,288,300],"four":[153],"six":[155],"times":[156,220],"as":[157,159,304],"large":[158],"an":[166,237],"two":[173],"variants.":[174],"A":[175],"remarkable":[176],"interesting":[178],"finding":[179],"zero-one":[185,216],"required":[189],"applications":[192,278],"II":[198],"3":[200],"4":[202],"respectively,":[203],"irrespective":[204],"or":[207,233,494],"size.":[209,235],"MILP's":[215],"many":[219,249,321,489],"larger":[221],"these":[223,345,362,511,568],"increases":[227],"rapidly":[228],"with":[229,308],"increase":[230],"in":[231,276,283,349,410,571],"However,":[236],"advantage":[238],"it":[245],"conditions.":[250],"Keywords:":[251],"computational":[252],"efficiency,":[253],"organizations,":[257],"costs,":[259],"management,":[261],"pro-rating":[262],"variables,":[263],"time-cost":[264],"trade-off.":[265],"(ProQuest:":[266],"...":[267],"denotes":[268],"formulae":[269],"omitted.)":[270],"INTRODUCTION":[271],"first":[273],"published":[274],"research":[275,318],"formal":[280],"optimization":[281],"techniques":[282,341],"planning":[285,486,574,597],"Kelly":[290,294],"&":[291,295,371,389,393,412,422,427,444,448,452,456,466,536,540],"Walker":[292,296],"(1959).":[293],"(1959)":[297],"developed":[298],"what":[299],"now":[301],"popularly":[302],"known":[303],"time-cost-trade-off":[305],"(TCTM)":[307],"time":[309],"constraints.":[310],"Their":[311],"pioneering":[312],"elicited":[314],"lot":[316],"interests":[319],"among":[320],"scholars":[322],"has":[325],"led":[326],"publications":[331],"different":[333,356],"types":[334,357],"models.":[338],"basic":[340],"most":[343],"rooted":[348],"mathematical":[350],"programming.":[351],"These":[352],"models/problems":[353],"categories.":[359],"Some":[360,481],"include:":[363],"i.":[364],"Client-contractor":[365],"interaction":[366],"problems":[367,403,434,499],"(Szmerekovskey,":[368],"2005;":[369],"Ulusory":[370,392],"Cabelli,":[372,394],"2000;":[373,395],"Westney,":[374,526],"1":[375],"992).":[376],"ii.":[377],"Discount":[378],"cash":[379,462],"flows/maximization":[380],"net":[382],"present":[383],"value":[384],"(":[387,464],"Etgar":[388],"Shtub,":[390],"1999;":[391],"Vanhoucke":[396,476],"et":[397,416,436,440,471,477,523,560],"al,":[398],"2003).":[399,480],"iii.":[400],"Resource-constrained":[401],"project-scheduling":[402],"(a":[404],"few":[405],"can":[407],"be":[408,584],"seen":[409],"Ballestin":[411],"Leus,":[413],"2009;":[414,418,442],"Hurink":[415],"al.,":[417,437,441,472,478,524,548,561],"Ranjbar,":[419],"2008;":[420,424,475],"Sabzehparvar":[421],"Seyed-Hosseini,":[423],"Vails,":[425],"Ballestin,":[426],"Quintamilla,":[428],"2004,":[429],"2005),":[430,551],"iv.":[431],"Time-cost":[432],"trade-off":[433],"(Brucker":[435],"199;":[438],"Castro-Lacouture":[439],"Jolayemi":[443,447,535,539],"Oluleye,":[445],"1994;":[446],"Pennington,":[449,541],"2007;":[450],"Ke":[451],"Liu,":[453],"2010;":[454],"Kolish":[455],"Hartmann,":[457],"2006),":[458],"v.":[460],"Time-dependent":[461],"flows":[463],"Dayanand":[465],"Padman":[467],"2001":[468],";":[469],"Herroelen":[470,522,559],"1997;":[473,525,549],"Jolai,":[474],"2001,":[479],"important":[482,512],"elements":[483],"scheduling,":[488],"subproblems":[493],"components":[495],"major":[498],"listed":[500],"above,":[501],"caught":[504],"attention":[506,583],"some":[508],"authors.":[509],"Among":[510],"elements/sub-problems":[513,570],"are:":[514],"*":[515,528,543,553],"Fixed":[516],"price":[517],"contract":[518,555],"arrangements":[519,556],"(Gilbreath,":[520,557],"1992;":[521,558],"1992)":[527],"Penalty":[529],"and/or":[530],"arrangement":[532],"(Jolayemi,":[533],"2002;":[534],"Olorunniwo,":[537],"2003;":[538],"2007).":[542],"Progress":[544],"payments":[545],"(Herroelen":[546],"at":[547],"Szmerekovskey,":[550],"Target":[554],"1997).":[562],"importance":[564],"key":[569],"successful":[573],"execution":[576],"requires":[579],"more":[582,590],"paid":[585],"models/techniques":[591],"their":[593],"efficient":[594],"effective":[596],"management.":[599],"\u2026":[600]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W214717176","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2016-06-24T00:00:00"}
