Pages that link to "Item:Q3055315"
From MaRDI portal
The following pages link to Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes (Q3055315):
Displayed 10 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Integrated production and transportation on parallel batch machines to minimize total weighted delivery time (Q1628115) (← links)
- Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study (Q1651526) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost (Q1652653) (← links)
- Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) (← links)
- A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532) (← links)
- Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
- Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
- Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms (Q3296266) (← links)