Single Machine Scheduling Problems: Standard Settings and Properties, Polynomially Solvable Cases, Complexity and Approximability
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems have appeared. They addressed many heuristics and enumerative procedures, complexity results or structural properties of certain problems. Regarding surveys, of...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
MDPI AG
2026-01-01
|
| Colección: | Algorithms |
| Materias: | |
| Acceso en línea: | https://www.mdpi.com/1999-4893/19/1/38 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|