Pages that link to "Item:Q5432690"

The following pages link to Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (Q5432690):

Displaying 29 items.

• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
• An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
• A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
• Hybrid flowshop scheduling with machine and resource-dependent processing times (Q534872) (← links)
• Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines (Q670464) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints (Q1762106) (← links)
• Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909) (← links)
• Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem (Q1791932) (← links)
• A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times (Q1791956) (← links)
• On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
• A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system (Q2052988) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (Q2285809) (← links)
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
• Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) (← links)
• Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
• A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling (Q3163193) (← links)
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
• Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling (Q5302318) (← links)
• Parallel variable neighbourhood search algorithms for job shop scheduling problems (Q5432691) (← links)
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
• Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem (Q6070990) (← links)
• Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time (Q6090472) (← links)
• The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)