{"id":"https://openalex.org/W2016007273","doi":"https://doi.org/10.1007/b101924","title":"Project Scheduling: A Research Handbook","display_name":"Project Scheduling: A Research Handbook","publication_year":2002,"publication_date":"2002-06-30","ids":{"openalex":"https://openalex.org/W2016007273","doi":"https://doi.org/10.1007/b101924","mag":"2016007273"},"language":"en","primary_location":{"id":"pmh:oai:203.131.219.242:ebook/8105","doi":null,"is_oa":false,"landing_page_url":"http://203.131.219.242/cdm/ref/collection/ebook/id/8105","pdf_url":null,"source":{"id":"https://openalex.org/S7407064352","display_name":"Thammasat University Digital Collections","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"volume":null,"type":"article","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/A5022083734","display_name":"Erik L. Demeulemeester","orcid":"https://orcid.org/0000-0001-7799-6510","observed_orcids":["https://orcid.org/0000-0001-7799-6510"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik Demeulemeester","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7799-6510","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103472063","display_name":"Willy S. Herroelen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Willy S. Herroelen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":30.2079,"has_fulltext":true,"cited_by_count":716,"citation_normalized_percentile":{"value":0.99721885,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9994999766349792,"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.9994999766349792,"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.00019999999494757503,"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/project-scheduling","display_name":"project scheduling","score":1.0},{"id":"https://openalex.org/keywords/resource-constrained-project-scheduling-problem","display_name":"resource-constrained project scheduling","score":0.9319999814033508},{"id":"https://openalex.org/keywords/temporal-analysis","display_name":"temporal analysis","score":0.8769999742507935},{"id":"https://openalex.org/keywords/deterministic-scheduling","display_name":"deterministic scheduling","score":0.6299999952316284},{"id":"https://openalex.org/keywords/stochastic-scheduling","display_name":"stochastic scheduling","score":0.7900000214576721},{"id":"https://openalex.org/keywords/robust-scheduling","display_name":"robust scheduling","score":0.7020000219345093},{"id":"https://openalex.org/keywords/reactive-scheduling","display_name":"reactive scheduling","score":0.9940000176429749}],"concepts":[{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.715013325214386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6882611513137817},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6642449498176575},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5680081844329834},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5594804286956787},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5274845957756042},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4761883318424225},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4725323021411896},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.45262855291366577},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.4376085102558136},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.4122142493724823},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.40009841322898865},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38755497336387634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20687729120254517},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.16692617535591125},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14713412523269653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09760379791259766},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0582866370677948}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:203.131.219.242:ebook/8105","doi":null,"is_oa":false,"landing_page_url":"http://203.131.219.242/cdm/ref/collection/ebook/id/8105","pdf_url":null,"source":{"id":"https://openalex.org/S7407064352","display_name":"Thammasat University Digital Collections","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:beyond.library.tu.ac.th:ebook/8105","doi":null,"is_oa":false,"landing_page_url":"http://beyond.library.tu.ac.th/cdm/ref/collection/ebook/id/8105","pdf_url":null,"source":{"id":"https://openalex.org/S4406923056","display_name":"TU Digital Collections (Thammasat University)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:dial.uclouvain.be:ebook:31931","doi":"https://doi.org/10.1007/b101924","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078/ebook:31931","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:2016007273","doi":null,"is_oa":false,"landing_page_url":"https://ci.nii.ac.jp/ncid/BA57551799","pdf_url":null,"source":{"id":"https://openalex.org/S4210197683","display_name":"Medical Entomology and Zoology","issn_l":"0424-7086","issn":["0424-7086","2185-5609"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319750","host_organization_name":"Japan Society of Medical Entomology and Zoology","host_organization_lineage":["https://openalex.org/P4310319750"],"host_organization_lineage_names":["Japan Society of Medical Entomology and Zoology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"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/W620587418","https://openalex.org/W2171761463","https://openalex.org/W2158814833","https://openalex.org/W2152999180","https://openalex.org/W2147507583","https://openalex.org/W2140742285","https://openalex.org/W2138543065","https://openalex.org/W2131167412","https://openalex.org/W2121852392","https://openalex.org/W2070891082","https://openalex.org/W2067801697","https://openalex.org/W2067462952","https://openalex.org/W2038345112","https://openalex.org/W2036112575","https://openalex.org/W2024742034","https://openalex.org/W1992710140","https://openalex.org/W1973131489","https://openalex.org/W1969848548","https://openalex.org/W178659373","https://openalex.org/W1580020823"],"abstract_inverted_index":{"Scope":[0],"and":[1,45],"Relevance":[2],"of":[3,11],"Project":[4,7,12,27,34,42],"Scheduling.-":[5,43],"The":[6,17,25],"Scheduling":[8,13,28,35],"Process.-":[9],"Classification":[10],"Problems.-":[14],"Temporal":[15,21],"Analysis:":[16,22],"Basic":[18],"Deterministic":[19],"Case.-":[20],"Advanced":[23,32],"Topics.-":[24,33],"Resource-Constrained":[26,30],"Problem.-":[29],"Scheduling:":[31],"with":[36],"Multiple":[37],"Activity":[38],"Execution":[39],"Modes.-":[40],"Stochastic":[41],"Robust":[44],"Reactive":[46],"Scheduling.":[47]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":25},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":30},{"year":2017,"cited_by_count":37},{"year":2016,"cited_by_count":32},{"year":2015,"cited_by_count":45},{"year":2014,"cited_by_count":43},{"year":2013,"cited_by_count":57},{"year":2012,"cited_by_count":50}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}