Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
From MaRDI portal
Publication:2102999
Recommendations
- Note on a single-machine scheduling problem with sum of processing times based learning and ready times
- A genetic algorithm-based approach for single-machine scheduling with learning effect and release time
- A hybrid heuristic approach for single machine scheduling with release times
- Tri-criteria single machine scheduling model with release times and learning factor
- Single-machine scheduling with learning functions
Cites work
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- 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
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Nonsmooth optimization via quasi-Newton methods
- Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
- Structured Learning and Prediction in Computer Vision
- The solution path of the generalized lasso
- What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
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)