Pages that link to "Item:Q391321"
From MaRDI portal
The following pages link to Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321):
Displayed 5 items.
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness (Q1666458) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Theoretical and practical issues in single-machine scheduling with two job release and delivery times (Q2066683) (← links)
- Fast solution of single-machine scheduling problem with embedded jobs (Q2420645) (← links)