domains / families / data / ordered-window-sequencing-mip

ordered-window-sequencing-mip

separate

Permutation and sequencing integer-programming formulations with ordered local-window variables, prefix/suffix continuity, and overlap penalties. Use when assigning exams, jobs, tasks, visits, blocks, or resources to ordered positions and costs depend on adjacent pairs, sliding triples, n-grams, short-horizon pressure, or overlapping local patterns.

When to use

• assigning exams, jobs, tasks, visits, blocks, or resources to ordered positions
• costs depending on adjacent pairs, sliding triples, n-grams, short-horizon pressure, or overlapping local patterns
• schedules, routes, job orders, block sequences, timetables, shift plans
• ordered assignments where costs depend on adjacent pairs, sliding windows, or overlapping local events

When not to use

• unordered tuple data unless explicitly stated
• sorting, canonicalizing, symmetrizing, or aggregating tuple keys unless explicitly allowed

Skill page

Source