The Setting
A scheduling window has a list of globally defined job sets, although only jobs between its boundaries belong to the current subproblem. Moving the left boundary changes which earlier jobs the list can retain. The past boundary condition concerns those jobs in the whole job set, including jobs outside the window.
Let be a valid deadline and a finite job set of size , with precedence relation . A layout is a bijection from to positions , read in consecutive triples.✦ The slot assignment of a layout is the function given in (1).✦ A layout respects precedence when entails ✦; it is full when it respects precedence and its number of jobs is divisible by three.✦ For a slot assignment , the open scheduling window is the set in (1).✦ (1)
A job triple is a three-element subset of .✦ A scheduling boundary is a left endpoint , an actual job triple , or a right endpoint .✦ A scheduling boundary is at slot if it is and , is and , or is a triple with consisting exactly of the jobs at .✦ The strict predecessor and successor cones and their weak versions are given by (2). (2)
A boundary separates a job set with cutoff set at slot when the two containments in (3) hold; write this condition as .✦ (3)✦
Global Lists and Priorities
An indexed global set family consists of a finite set of listed indices and a job set at every index.✦ For a global family , a rank and a scale , the global qualifier set , the membership index set of a job , the last membership index and the numeric priority assignment are the sets, index and assignment given in (4). Lexicographic list priority compares jobs first by their last membership indices and then, when those indices agree, by their ranks, as in (4).✦ (4)
A global upset is a job set closed under taking successors.✦ A global family has upward closed entries when each listed is a global upset.✦ A global family has injection entries disjoint within a job set when for distinct listed .✦ The past boundary invariant is the containment in (5).✦ (5)✦
For a global family and a job set , the pruned family is the global family that retains exactly the indices whose entries meet , leaving the global entries unchanged.✦ For a global family , a rank , an index and a rank threshold , the suffix is the global family obtained by discarding indices below , restricting the entry at to , and retaining entries above .✦ For a global family , rank , scale , sets and a nonnegative integer threshold , the unchanged-direction update is the family in (6).✦ For an indexed global set family on and a job set , the appended global family is the family obtained by placing after the existing entries of .✦ (6)✦
The same-list priority is the natural-number priority assignment specified by a global family, rank, scale and distinguished job set . The direction-change priority is the natural-number priority assignment specified by a rank, scale and distinguished job set . For a priority assignment , a rank and a threshold , the priority cut and the rank upper tail are the job sets in (7). (7)
For layouts and a job set , is unchanged outside relative to when for every .✦ For a layout and a priority assignment , the priority signature of under is the sequence .✦ A layout is locally normalized on a job set under a priority assignment when it respects precedence and its priority signature under is lexicographically no greater than that of every precedence-respecting layout unchanged outside relative to .✦
For a layout and jobs , the exchange is the layout obtained by interchanging the positions of in .✦ The forbidden exchange invariant requires that, for every precedence-respecting unchanged outside relative to , exchanging with at slot fails precedence feasibility whenever .✦
Cutoff Walks
A relative order ideal on a finite job set is a set such that , , and imply .✦ A priority prefix on under is a set such that whenever and .✦
The local priority obstruction condition requires that whenever satisfy and , and every predecessor of in is earlier than , there is a successor of in with .✦
The cutoff descendants at slot form the set in (8).✦ An earliest exceptional job for is a job with and , such that every with belongs to .✦ (8)✦
A cutoff walk is a finite sequence of cutoffs from to , possibly of length zero, whose steps have the following form. At cutoff , choose a relative order ideal and priority prefix on with , choose an earliest exceptional job for , and make the next cutoff.
Structural Certificates
A Boolean structural formula over an atomic family of job sets is an expression consisting of an atom or its complement, or a conjunction or disjunction of two Boolean structural formulas.✦ The interpretation of a Boolean structural formula over an atomic family of job sets is the job set obtained by replacing conjunction and disjunction by intersection and union.✦ A leaf contributes one to the leaf count; either binary operation adds its two counts.✦ A job set has a description over an atomic family with allowance if it is the interpretation of a Boolean structural formula over with at most leaves; the fixed allowance is .✦
The family has atomic predicate expressiveness for when , , every rank upper tail, every strict or weak boundary cone, and every job triple have descriptions with at most one leaf.✦ For a boundary at slot and a scheduling window , a switch seed at is a global upset described with at most leaves such that and every job in is later than .✦
A rank threshold run certificate for is a collection of base sets , thresholds and a second set satisfying (9). Every listed nonzero base has a description with at most two leaves, has one with at most , and has one with at most one. (9)
An edge structural certificate in , where denotes , has a full layout , parent , and boundaries at , respectively. Its target is actual, and . An edge structural certificate is a collection of cutoff sets , a global family with a rank threshold run certificate, and global sets with the conditions in (10). The final cutoff has a one-leaf description. All listed entries and the run’s second set are global upsets, and the injection entries are disjoint within . The set has a description with at most leaves; has one with at most and is closed under taking predecessors. (10)
The Claim
Theorem 1. For the unchanged-direction assertion (11), let be full for a transitive precedence relation, with at . Let and , where , , and . Suppose , for all jobs, and strictly increases along precedence. Let have upward closed entries, with and for a boundary . Assume and . Put , take , and set and . Suppose , , and . Then $$\mathsf{Past}_{\tau_p}\!left( \mathcal U_t(\mathcal L;\rho,M,D(A),P(Z)),A',a'\right).$$(11)✦
For the general update assertion (12), let be full for a transitive precedence relation, be at , and , with and . Let be global families, let , and let be a priority assignment. Assume , with a global upset contained in . Every qualifier of at or before must belong to , and both and must be disjoint from . Assume , , and . Finally, suppose that whenever is a relative order ideal and priority prefix on with , is an earliest exceptional job for , and is at slot , there is with and . Then (12)✦
Let be any slot assignment and let satisfy . For every job set , (13)✦
For the direction-change assertion (14), let be full for a transitive precedence relation. Suppose has atomic predicate expressiveness, for every job, and strictly increases along precedence. Let , with at and , and assume a switch seed at exists. Choose and a boundary at with . Let , with at and actual. Take and put . Suppose is locally normalized on under , and both and hold. Then (14)✦
In the paper, the result reads: the updated child list satisfies the invariant that every global qualifier scheduled at or before its left boundary belongs to that boundary’s weak predecessor cone.
What Is Checked
The assertions are stated over finite job layouts and global set families, with boundary separation and cutoff walks for updates, rank and bounded-description conditions for direction changes, and arbitrary slot assignments for pruning.