Pages that link to "Item:Q1341398"

The following pages link to Unrelated parallel machine scheduling using local search (Q1341398):

Displaying 31 items.

• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
• Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information (Q473662) (← links)
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
• Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228) (← links)
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
• Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
• The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling (Q1592285) (← links)
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server (Q1634053) (← links)
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← links)
• Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
• A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
• Parallel genetic algorithms with local search (Q1915976) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing (Q2218774) (← links)
• A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
• Decomposition methods for the parallel machine scheduling problem with setups (Q2806866) (← links)
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling (Q3557013) (← links)
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)