{"id":"https://openalex.org/W1515176649","doi":"https://doi.org/10.1023/a:1018995000688","title":"Satisfiability tests and time\u2010bound adjustmentsfor cumulative scheduling problems","display_name":"Satisfiability tests and time\u2010bound adjustmentsfor cumulative scheduling problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1515176649","doi":"https://doi.org/10.1023/a:1018995000688","mag":"1515176649"},"language":"en","primary_location":{"id":"doi:10.1023/a:1018995000688","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018995000688","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","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/A5012144650","display_name":"Ph. Baptiste","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ph. Baptiste","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057318656","display_name":"Claude Le Pape","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Le Pape","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046891068","display_name":"Wpm Wim Nuijten","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W. Nuijten","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":7.9432,"has_fulltext":false,"cited_by_count":127,"citation_normalized_percentile":{"value":0.97998544,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"92","issue":"0","first_page":"305","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9825999736785889,"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.9825999736785889,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0032999999821186066,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0020000000949949026,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6243937015533447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.608679473400116},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5949762463569641},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5613634586334229},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5446473956108093},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.532806396484375},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4453907907009125},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.42298686504364014},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4210856258869171},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42087504267692566},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.41962334513664246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3216691017150879},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.268887460231781}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6243937015533447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.608679473400116},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5949762463569641},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5613634586334229},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5446473956108093},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.532806396484375},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4453907907009125},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.42298686504364014},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4210856258869171},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42087504267692566},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41962334513664246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3216691017150879},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.268887460231781},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1023/a:1018995000688","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018995000688","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/71a4811c-b1df-400b-bc58-f1443603b3a6","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/71a4811c-b1df-400b-bc58-f1443603b3a6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Baptiste, P, Le Pape, C & Nuijten, W P M 1999, 'Satisfiability tests and time-bound adjustments for cumulative scheduling problems', Annals of Operations Research, vol. 92, pp. 305-333. https://doi.org/10.1023/A:1018995000688","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:annopr:v:92:y:1999:i:0:p:305-333:10.1023/a:1018995000688","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1023/A:1018995000688","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"},{"id":"pmh:tue:oai:pure.tue.nl:publications/71a4811c-b1df-400b-bc58-f1443603b3a6","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/71a4811c-b1df-400b-bc58-f1443603b3a6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of Operations Research, 92(0), 305 - 333. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W53596869","https://openalex.org/W60640492","https://openalex.org/W1509488457","https://openalex.org/W1538991764","https://openalex.org/W1555523867","https://openalex.org/W1563502261","https://openalex.org/W1575036742","https://openalex.org/W1583233220","https://openalex.org/W1610326124","https://openalex.org/W1992710140","https://openalex.org/W2007363252","https://openalex.org/W2011039300","https://openalex.org/W2020459421","https://openalex.org/W2043566022","https://openalex.org/W2071306171","https://openalex.org/W2089511478","https://openalex.org/W2091316547","https://openalex.org/W2131167412","https://openalex.org/W2157503827","https://openalex.org/W2168328014","https://openalex.org/W2171761463","https://openalex.org/W2337842618","https://openalex.org/W2487540326","https://openalex.org/W2605191981","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1986831235","https://openalex.org/W1496189149","https://openalex.org/W4249573192","https://openalex.org/W4255223395","https://openalex.org/W2089185195","https://openalex.org/W2060500675","https://openalex.org/W2041682173","https://openalex.org/W2145208114","https://openalex.org/W2002220688","https://openalex.org/W2383692867"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}