Pages that link to "Item:Q4245710"
From MaRDI portal
The following pages link to Control of a batch-processing machine: A computational approach (Q4245710):
Displayed 13 items.
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730) (← 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)
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312) (← links)
- Learning effective dispatching rules for batch processor scheduling (Q5385460) (← links)