Pages that link to "Item:Q1944199"
From MaRDI portal
The following pages link to An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times (Q1944199):
Displaying 10 items.
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times (Q423933) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Online batch scheduling on parallel machines with delivery times (Q719274) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- Online unbounded batch scheduling on parallel machines with delivery times (Q2354308) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)