Pages that link to "Item:Q3034827"
From MaRDI portal
The following pages link to The Two-Processor Scheduling Problem is in Random NC (Q3034827):
Displayed 4 items.
- Matching is as easy as matrix inversion (Q1095658) (← links)
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling (Q1870558) (← links)
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs (Q1924401) (← links)
- Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
