Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine
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/614 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine
- Concurrent Openshop Problem to Minimize the Weighted Number of Late Jobs
- Scheduling a single machine with compressible jobs to minimize maximum lateness
- Moore's Greedy Algorithm for Minimizing the Number of Late Jobs: Structure and Implementation
- Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Scheduling
- A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
- Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates