Learning variable neighborhood search for a scheduling problem with time windows and rejections

DOI10.1016/j.dam.2018.03.019zbMath1409.68273OpenAlexW2794588190MaRDI QIDQ2414479

Nicolas Zufferey, Simon Thevenin

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.019

zbMATH Keywords

learning processvariable neighborhood searchjob scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

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

Uses Software

• Tabu search

Cites Work

• A Heuristic for Nonlinear Global Optimization
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
• Order acceptance/rejection policies in determining the sequence in mixed model assembly lines
• A survey on offline scheduling with rejection
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
• An improved earliness--tardiness timing algorithm
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
• Variable neighborhood search
• A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
• Variable neighborhood search: basics and variants
• Optimization by ant algorithms: possible roles for an individual ant
• Future paths for integer programming and links to artificial intelligence
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem
• Variable neighborhood search for the linear ordering problem
• A survey on scheduling problems with due windows
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Single CNC machine scheduling with controllable processing times and multiple due dates
• Tabu Search—Part I
• A learning tabu search for a truck allocation problem with linear and nonlinear cost components
• Scheduling
• Handbook of metaheuristics
• Adaptive memory programming: a unified view of metaheuristics

This page was built for publication: Learning variable neighborhood search for a scheduling problem with time windows and rejections