Pages that link to "Item:Q1135762"
From MaRDI portal
The following pages link to Characterizing the set of feasible sequences for n jobs to be carried out on a single machine (Q1135762):
Displaying 6 items.
- Local adjustments: A general algorithm (Q707084) (← links)
- Applying new dominance concepts to job schedule optimization (Q1162922) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- An efficient ILP formulation for the single machine scheduling problem (Q5189883) (← links)
