Pages that link to "Item:Q2699097"
From MaRDI portal
The following pages link to A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097):
Displaying 3 items.
- A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times (Q1268839) (← links)
- Approximate and robust bounded job start scheduling for Royal Mail delivery offices (Q2061143) (← links)
- Scheduling with tree-hierarchical processing set restrictions (Q4986067) (← links)