Pages that link to "Item:Q336992"
From MaRDI portal
The following pages link to An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992):
Displaying 16 items.
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes (Q1029348) (← links)
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
- Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
- Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
- Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions (Q3974115) (← links)
- An improved ant colony algorithm for solving batch scheduling problems with non-identical job sizes (Q5257191) (← links)
- A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)
- Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)
