Pages that link to "Item:Q1041346"
From MaRDI portal
The following pages link to Non-approximability of just-in-time scheduling (Q1041346):
Displaying 7 items.
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- On inverse chromatic number problems (extended abstract) (Q2861543) (← links)
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs (Q5452164) (← links)