Pages that link to "Item:Q4245364"
From MaRDI portal
The following pages link to Dynamic job assignment heuristics for multi-server batch operations- A cost based approach (Q4245364):
Displayed 11 items.
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
- Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices (Q2954338) (← links)
- Non-exhaustive family based dispatching heuristics–exploiting variances of processing and set-up times (Q3163249) (← links)
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance (Q3163712) (← links)
- Dynamic scheduling of batch servers with compatible product families (Q4666778) (← links)
- Adaptive scheduling of batch servers in flow shops (Q4710093) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)
- Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
