Pages that link to "Item:Q336679"
From MaRDI portal
The following pages link to Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679):
Displaying 24 items.
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
- Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing (Q342170) (← links)
- 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)
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526) (← links)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Scheduling unrelated additive manufacturing machines with practical constraints (Q2147124) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- A solution framework for scheduling a BPM with non-identical job dimensions (Q2468858) (← links)
- Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
- Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing (Q2668671) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes (Q2992407) (← links)
- Weak-restriction based algorithm for scheduling on parallel batch machines with arbitrary capacities (Q5381317) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902) (← links)
- Parallel batching with multi-size jobs and incompatible job families (Q6168657) (← links)
- Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints (Q6551068) (← links)
