Pages that link to "Item:Q5959373"
From MaRDI portal
The following pages link to Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure (Q5959373):
Displayed 12 items.
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes (Q941534) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040) (← links)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- MIP formulations and heuristics for solving parallel batching problems (Q2429916) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness (Q4670270) (← links)
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853) (← links)
