{"id":"https://openalex.org/W1496031892","doi":"https://doi.org/10.1023/a:1009856210543","title":"Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling","display_name":"Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling","publication_year":2000,"publication_date":"2000-10-01","ids":{"openalex":"https://openalex.org/W1496031892","doi":"https://doi.org/10.1023/a:1009856210543","mag":"1496031892"},"language":"en","primary_location":{"id":"doi:10.1023/a:1009856210543","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009856210543","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"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":"Constraints","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/A5008721559","display_name":"Hani El Sakkout","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hani El Sakkout","raw_affiliation_strings":["IC-Parc, Imperial College, London","IC-Parc, Imperial College London#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IC-Parc, Imperial College, London","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"IC-Parc, Imperial College London#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013174025","display_name":"Mark Wallace","orcid":"https://orcid.org/0000-0001-7326-8110"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mark Wallace","raw_affiliation_strings":["IC-Parc, Imperial College, London","IC-Parc, Imperial College London#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IC-Parc, Imperial College, London","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"IC-Parc, Imperial College London#TAB#","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":12.8973,"has_fulltext":false,"cited_by_count":145,"citation_normalized_percentile":{"value":0.98465928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"5","issue":"4","first_page":"359","last_page":"388"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9973000288009644,"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/T10142","display_name":"Formal Methods in Verification","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.8198250532150269},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6950700879096985},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6815996766090393},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.646237850189209},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6116923093795776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5110893845558167},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.49104833602905273},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4402102828025818},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.41495394706726074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25730353593826294},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.18478703498840332},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09849536418914795},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08709946274757385}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.8198250532150269},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6950700879096985},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6815996766090393},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.646237850189209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6116923093795776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5110893845558167},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.49104833602905273},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4402102828025818},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.41495394706726074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25730353593826294},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.18478703498840332},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09849536418914795},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08709946274757385},{"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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1009856210543","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1009856210543","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"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":"Constraints","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W59411647","https://openalex.org/W64635289","https://openalex.org/W95693098","https://openalex.org/W272982077","https://openalex.org/W1411979259","https://openalex.org/W1492099040","https://openalex.org/W1519941054","https://openalex.org/W1548650523","https://openalex.org/W1575036742","https://openalex.org/W1606581042","https://openalex.org/W1890235978","https://openalex.org/W1978254750","https://openalex.org/W2001636851","https://openalex.org/W2011039300","https://openalex.org/W2027140251","https://openalex.org/W2032912812","https://openalex.org/W2033040247","https://openalex.org/W2040296085","https://openalex.org/W2084517692","https://openalex.org/W2121766240","https://openalex.org/W2130182605","https://openalex.org/W2132020706","https://openalex.org/W2134094348","https://openalex.org/W2135354889","https://openalex.org/W2140272057","https://openalex.org/W2169653928","https://openalex.org/W2336259629","https://openalex.org/W2567083789","https://openalex.org/W2611147814","https://openalex.org/W2984454117"],"related_works":["https://openalex.org/W2753007631","https://openalex.org/W1985869163","https://openalex.org/W2380451491","https://openalex.org/W2504687579","https://openalex.org/W4281297310","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2147600044","https://openalex.org/W3116484972"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2016-06-24T00:00:00"}