Integer programming models and metaheuristics for customer order scheduling
From MaRDI portal
Cites work
- A learning-based two-stage optimization method for customer order scheduling
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- Comparing evolutionary algorithms to the (\(1+1\))-EA
- Customer order scheduling on a single machine with family setup times: complexity and algorithms
- Customer order scheduling to minimize the number of late jobs
- Evolution strategies. A comprehensive introduction
- From black-box complexity to designing new genetic algorithms
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Mathematical programming formulations for machine scheduling: A survey
- New approximate algorithms for the customer order scheduling problem with total completion time objective
- The use of dynamic programming in genetic algorithms for permutation problems
This page was built for publication: Integer programming models and metaheuristics for customer order scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6945710)
