Pages that link to "Item:Q2459402"

The following pages link to Exponential neighborhood search for a parallel machine scheduling problem (Q2459402):

Displaying 13 items.

• Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
• Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
• Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
• Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← links)
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611) (← links)
• An exponential neighborhood for a one-machine batching problem (Q1808727) (← links)
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
• A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (Q5432690) (← links)