Pages that link to "Item:Q498410"
From MaRDI portal
The following pages link to Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals (Q498410):
Displaying 5 items.
- Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
- Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period (Q887888) (← links)
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)
