Pages that link to "Item:Q2414479"

The following pages link to Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479):

Displaying 10 items.

• Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions (Q1698296) (← links)
• Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
• Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint (Q6043112) (← links)
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
• Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study (Q6071074) (← links)
• Pattern mining‐based pruning strategies in stochastic local searches for scheduling problems (Q6082181) (← links)
• Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
• A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG (Q6201534) (← links)
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)