Pages that link to "Item:Q622134"

The following pages link to Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134):

Displaying 16 items.

• A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis (Q322575) (← links)
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm (Q336698) (← links)
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
• Analysis of the similarities and differences of job-based scheduling problems (Q723975) (← 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)
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem (Q1692274) (← links)
• Solving multi-objective parallel machine scheduling problem by a modified NSGA-II (Q1788959) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times (Q2243380) (← links)
• A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
• Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (Q6164365) (← links)