Pages that link to "Item:Q5478853"

The following pages link to Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes (Q5478853):

Displaying 22 items.

• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
• Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
• A particle swarm optimizer for grouping problems (Q497654) (← links)
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← links)
• Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006) (← links)
• Grouping evolution strategies: an effective approach for grouping problems (Q2009978) (← links)
• Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← 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)
• Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times (Q2628197) (← links)
• Single batch machine scheduling with dual setup times for autoclave molding manufacturing (Q2668803) (← links)
• Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
• Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
• Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes (Q3055315) (← links)
• Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
• The Find-Fix-Finish-Exploit-Analyze (F3EA) Meta-Heuristic Algorithm with an Extended Constraint Handling Technique for Constrained Optimization (Q5011377) (← links)
• A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
• A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)