Computational complexity and exact techniques for scheduling problems with job prohibitions
From MaRDI portal
Cites work
- Algorithms for the Assignment and Transportation Problems
- Efficient approximation algorithms for the routing open shop problem
- Exploring the complexity boundary between coloring and list-coloring
- scientific article; zbMATH DE number 6007914 (Why is no real title available?)
- scientific article; zbMATH DE number 3746841 (Why is no real title available?)
- scientific article; zbMATH DE number 41713 (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 1104328 (Why is no real title available?)
- scientific article; zbMATH DE number 1487885 (Why is no real title available?)
- scientific article; zbMATH DE number 956786 (Why is no real title available?)
- Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem
- Introduction to algorithms
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing Total Tardiness on One Machine is NP-Hard
- Mixed integer programming models for job shop scheduling: A computational analysis
- NP-hardness of shop-scheduling problems with three jobs
- On complexity of optimal recombination for flowshop scheduling problems
- On complexity of optimal recombination for one scheduling problem with setup times
- On solving travelling salesman problem with vertex requisitions
- Optimal recombination in genetic algorithms for combinatorial optimization problems. II
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy
- Quasi-optimal recombination operator
- Routing open shop with unrelated travel times
- Scheduling algorithms
- Scheduling for parallel processing
- Staff scheduling and rostering: a review of applications, methods and models.
- The algebra of genetic algorithms
- The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
- The use of dynamic programming in genetic algorithms for permutation problems
This page was built for publication: Computational complexity and exact techniques for scheduling problems with job prohibitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397382)
