Hybrid Job Shop and Parallel Machine Scheduling Problems: Minimization of Total Tardiness Criterion
None
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2007
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/625 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Hybrid Job Shop and Parallel Machine Scheduling Problems: Minimization of Total Tardiness Criterion
- Ant Colony Optimization For Multiobjective Buffers Sizing Problems
- Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
- Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
- Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
- Data-driven Algorithm for Scheduling with Total Tardiness
- Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Scheduling