{"id":"https://openalex.org/W2041993861","doi":"https://doi.org/10.1137/0204041","title":"On Scheduling Chains of Jobs on One Processor with Limited Preemption","display_name":"On Scheduling Chains of Jobs on One Processor with Limited Preemption","publication_year":1975,"publication_date":"1975-12-01","ids":{"openalex":"https://openalex.org/W2041993861","doi":"https://doi.org/10.1137/0204041","mag":"2041993861"},"language":"en","primary_location":{"id":"doi:10.1137/0204041","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204041","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5109919265","display_name":"John Bruno","orcid":"https://orcid.org/0009-0003-8003-8331"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"John Bruno","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045598051","display_name":"Micha Hofri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micha Hofri","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109919265"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7116,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95840407,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"4","first_page":"478","last_page":"490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9635999798774719,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9563000202178955,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.8995808362960815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7480366230010986},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6807703971862793},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5478633642196655},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5083596110343933},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.47029659152030945},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4539780616760254},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4343371093273163},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.4299928545951843},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.41189563274383545},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3993583917617798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1674070656299591}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8995808362960815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7480366230010986},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6807703971862793},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5478633642196655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5083596110343933},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.47029659152030945},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4539780616760254},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4343371093273163},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.4299928545951843},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.41189563274383545},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3993583917617798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1674070656299591},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0204041","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204041","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1998729850","https://openalex.org/W2049994136","https://openalex.org/W2096521993","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W4387006201","https://openalex.org/W2014652166","https://openalex.org/W2046459844","https://openalex.org/W4231666827","https://openalex.org/W3199515700","https://openalex.org/W2081189842","https://openalex.org/W2358315670"],"abstract_inverted_index":{"A":[0],"scheduling":[1],"rule":[2,71],"is":[3,20,63,110],"given":[4],"for":[5,75,81],"determining":[6],"the":[7,14,23,52,61,99,102,113,117],"processing":[8],"order":[9],"of":[10,17,68,73],"tasks":[11,39,53,83],"which":[12,88],"have":[13,116],"precedence":[15],"structure":[16],"chains.":[18],"It":[19,109],"assumed":[21],"that":[22,29,34,50,60,112,120],"service":[24,46,62,131],"times":[25],"follow":[26],"known":[27],"distributions,":[28],"they":[30],"are":[31,36,48,54],"all":[32,51],"independent,":[33],"costs":[35],"accrued":[37],"by":[38],"at":[40,56,65,94],"a":[41,85,124],"constant":[42],"rate":[43],"until":[44],"their":[45],"requirements":[47],"satisfied,":[49],"available":[55],"time":[57,98],"0":[58],"and":[59,84],"interruptible":[64],"task-specific":[66],"sets":[67],"points.":[69],"The":[70],"consists":[72],"computing":[74],"each":[76,95],"chain":[77,100],"an":[78,106],"\u201coptimal":[79,114],"assignment\u201d":[80],"its":[82,129],"rank":[86,104],"function":[87],"depends":[89],"on":[90],"this":[91],"assignment.":[92],"Choosing":[93],"point":[96],"in":[97],"with":[101],"smallest":[103],"produces":[105],"optimal":[107],"schedule.":[108],"proved":[111],"assignments\u201d":[115],"desirable":[118],"property":[119],"as":[121,123],"long":[122],"task":[125],"does":[126],"not":[127],"exceed":[128],"allotted":[130],"time,":[132],"no":[133],"preemption":[134],"should":[135],"take":[136],"place.":[137]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
