Pages that link to "Item:Q1762006"

The following pages link to Makespan minimization on single batch-processing machine via ant colony optimization (Q1762006):

Displaying 17 items.

• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes (Q300033) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes (Q336679) (← links)
• An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes (Q336992) (← links)
• A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours (Q337075) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system (Q1652207) (← links)
• Scheduling batch processing machine using max-min ant system algorithm improved by a local search method (Q1720742) (← links)
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes (Q1751665) (← 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)
• 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)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm (Q2795178) (← links)
• Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices (Q2954338) (← links)
• A hybrid neural network approach to minimize total completion time on a single batch processing machine (Q6092620) (← links)
• Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization (Q6167854) (← links)