Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times

DOI10.1016/J.EJOR.2022.06.040OpenAlexW4283522503MaRDI QIDQ2102999FDOQ2102999

Axel Parmentier, Vincent T'kindt

Publication date: 12 December 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.040

zbMATH Keywords

local searchschedulingsingle machinestructured learning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The solution path of the generalized lasso
• Nonsmooth optimization via quasi-Newton methods
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A hybrid heuristic approach for single machine scheduling with release times
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• An iterative heuristic for the single machine dynamic total completion time scheduling problem
• Structured Learning and Prediction in Computer Vision
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• GitHub

This page was built for publication: Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102999)