{"id":"https://openalex.org/W1989885343","doi":"https://doi.org/10.3390/a2041449","title":"Exact and Heuristic Algorithms for Thrift Cyclic Scheduling","display_name":"Exact and Heuristic Algorithms for Thrift Cyclic Scheduling","publication_year":2009,"publication_date":"2009-11-26","ids":{"openalex":"https://openalex.org/W1989885343","doi":"https://doi.org/10.3390/a2041449","mag":"1989885343"},"language":"en","primary_location":{"id":"doi:10.3390/a2041449","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a2041449","pdf_url":"https://www.mdpi.com/1999-4893/2/4/1449/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/2/4/1449/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016807947","display_name":"Michael Short","orcid":"https://orcid.org/0000-0001-6290-4396"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michael  J. Short","raw_affiliation_strings":["Embedded Systems Laboratory, University of Leicester, Leicester, UK"],"affiliations":[{"raw_affiliation_string":"Embedded Systems Laboratory, University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016807947"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07015294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"4","first_page":"1449","last_page":"1472"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.8010032176971436},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.7930539846420288},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6131263971328735},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5889722108840942},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5742742419242859},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.5643770694732666},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5496514439582825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5250917673110962},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4281435012817383},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3474847674369812},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.28015264868736267},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.14151573181152344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12299510836601257},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10348919034004211}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8010032176971436},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.7930539846420288},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6131263971328735},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5889722108840942},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5742742419242859},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.5643770694732666},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5496514439582825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5250917673110962},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4281435012817383},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3474847674369812},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28015264868736267},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.14151573181152344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12299510836601257},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10348919034004211},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a2041449","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a2041449","pdf_url":"https://www.mdpi.com/1999-4893/2/4/1449/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:bda1ef54a9684ed9bafe0f0b23903101","is_oa":true,"landing_page_url":"https://doaj.org/article/bda1ef54a9684ed9bafe0f0b23903101","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 2, Iss 4, Pp 1449-1472 (2009)","raw_type":"article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire/fe38ee9e-f77c-44a5-b29c-55c7c6c8b806","is_oa":true,"landing_page_url":"https://research.tees.ac.uk/en/publications/fe38ee9e-f77c-44a5-b29c-55c7c6c8b806","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Short, M J 2009, 'Exact and heuristic algorithms for thrift cyclic scheduling', Algorithms, vol. 2, no. 4, pp. 1449-1472. https://doi.org/10.3390/a2041449","raw_type":"article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:publications/fe38ee9e-f77c-44a5-b29c-55c7c6c8b806","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84859629023&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Short, M J 2009, 'Exact and heuristic algorithms for thrift cyclic scheduling', Algorithms, vol. 2, no. 4, pp. 1449-1472. https://doi.org/10.3390/a2041449","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a2041449","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a2041449","pdf_url":"https://www.mdpi.com/1999-4893/2/4/1449/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989885343.pdf","grobid_xml":"https://content.openalex.org/works/W1989885343.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W65715921","https://openalex.org/W1517036688","https://openalex.org/W1534786329","https://openalex.org/W1968681775","https://openalex.org/W1994163368","https://openalex.org/W2010340462","https://openalex.org/W2011039300","https://openalex.org/W2019133545","https://openalex.org/W2034941894","https://openalex.org/W2039591936","https://openalex.org/W2086748818","https://openalex.org/W2089225049","https://openalex.org/W2096732213","https://openalex.org/W2104680817","https://openalex.org/W2112696369","https://openalex.org/W2120013889","https://openalex.org/W2137784941","https://openalex.org/W2147886401","https://openalex.org/W2151635387","https://openalex.org/W2336850053","https://openalex.org/W3013976155"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2509452605","https://openalex.org/W2112121444","https://openalex.org/W2148608945","https://openalex.org/W3012609114","https://openalex.org/W2003327526","https://openalex.org/W4226218108","https://openalex.org/W2008132520","https://openalex.org/W2365404043"],"abstract_inverted_index":{"Non-preemptive":[0],"schedulers,":[1],"despite":[2],"their":[3],"many":[4],"discussed":[5],"drawbacks,":[6],"remain":[7],"a":[8,48,152],"very":[9],"popular":[10],"choice":[11],"for":[12,37,54,85,139,156,165,186],"practitioners":[13],"of":[14,24,40,67,97,134,169,183,196,210],"real-time":[15],"and":[16,50,191],"embedded":[17,42],"systems.":[18,43],"The":[19,141,176,208],"non-preemptive":[20],"\u2018thrift\u2019":[21],"cyclic":[22],"scheduler\u2014variations":[23],"which":[25,102],"can":[26,64,79,199],"be":[27,200],"found":[28],"in":[29,101],"other":[30],"application":[31],"areas\u2014has":[32],"recently":[33],"received":[34],"considerable":[35],"attention":[36],"the":[38,68,98,103,112,131,145,188,206],"implementation":[39,52],"such":[41,110],"A":[44],"thrift":[45],"scheduler":[46],"provides":[47],"flexible":[49],"compact":[51],"model":[53],"periodic":[55],"task":[56,87,108,122],"sets":[57],"with":[58,71,93],"comparatively":[59],"small":[60],"overheads;":[61],"additionally,":[62],"it":[63,127,161],"overcome":[65],"several":[66],"problems":[69],"associated":[70],"traditional":[72],"\u2018cyclic":[73],"executives\u2019.":[74],"However,":[75],"severe":[76],"computational":[77],"difficulties":[78],"still":[80],"arise":[81],"when":[82],"designing":[83],"schedules":[84],"non-trivial":[86],"sets.":[88],"This":[89],"paper":[90,142,177],"is":[91,105,117,128,137,159,162,174,213],"concerned":[92],"an":[94],"optimization":[95],"version":[96,133],"offset-assignment":[99,189],"problem,":[100,190],"objective":[104],"to":[106,202],"assign":[107],"offsets":[109],"that":[111,121,130,164],"required":[113],"CPU":[114],"clock":[115],"speed":[116,204],"minimized":[118],"whilst":[119],"ensuring":[120],"overruns":[123],"do":[124],"not":[125],"occur;":[126],"known":[129],"decision":[132],"this":[135,157],"problem":[136,158],"complete":[138],"\u03a32p.":[140],"first":[143],"considers":[144,192],"problemof":[146],"candidate":[147],"solution":[148],"verification\u2014itself":[149],"strongly":[150],"coNP-Complete\u2014and":[151],"fast,":[153],"exact":[154],"algorithm":[155],"proposed;":[160],"shown":[163],"any":[166],"fixed":[167],"number":[168],"tasks,":[170],"its":[171],"execution":[172],"time":[173],"polynomial.":[175],"then":[178,214],"proposes":[179],"two":[180],"heuristic":[181],"algorithms":[182,212],"pseudopolynomial":[184],"complexity":[185],"solving":[187],"how":[193],"redundant":[194],"choices":[195],"offset":[197],"combinations":[198],"eliminated":[201],"help":[203],"up":[205],"search.":[207],"performance":[209],"these":[211],"experimentally":[215],"evaluated,":[216],"before":[217],"conclusions":[218],"are":[219],"drawn.":[220]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}