Machine scheduling instance generation by reverse engineering from instance space analysis
From MaRDI portal
Cites work
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- A mixed evolutionary-statistical analysis of an algorithm's complexity
- A new class of hard problem instances for the 0-1 knapsack problem
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Enhanced instance space analysis for the maximum flow problem
- Evolutionary Computation in Combinatorial Optimization
- Evolving test instances of the Hamiltonian completion problem
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Generating applicable synthetic instances for branch problems
- Generating new test instances by evolving in instance space
- Generation techniques for linear programming instances with controllable properties
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Instance space analysis for a personnel scheduling problem
- Instance space analysis for the car sequencing problem
- Instance spaces for machine learning classification
- Learning-augmented heuristics for scheduling parallel serial-batch processing machines
- Measuring instance difficulty for combinatorial optimization problems
- Needed: An Empirical Science of Algorithms
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Synthetic optimization problem generation: show us the correlations!
- Testing heuristics: We have it all wrong
- The generation of experimental data for computational testing in optimization
- The international timetabling competition on sports timetabling (ITC2021)
- Towards objective measures of algorithm performance across instance space
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
This page was built for publication: Machine scheduling instance generation by reverse engineering from instance space analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233286)
