Pages that link to "Item:Q300033"

The following pages link to A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033):

Displaying 13 items.

• Integrated production and delivery on parallel batching machines (Q320081) (← 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)
• MILP models to minimise makespan in additive manufacturing machine scheduling problems (Q1722963) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
• The piggyback transportation problem: transporting drones launched from a flying warehouse (Q2242297) (← 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)
• A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
• Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time (Q2676295) (← links)
• Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)