eBooks :: Kembali

eBooks :: Kembali

Complex scheduling

Peter Brucker, Sigrid Knust ([Springer, ], 2012)

 Abstrak

[This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented. They are used in exact or heuristic procedures to solve theintroduced complex scheduling problems. Furthermore, methods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples., This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented. They are used in exact or heuristic procedures to solve theintroduced complex scheduling problems. Furthermore, methods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples.]

 File Digital: 1

Shelf
 Complex Scheduling.pdf :: Unduh

LOGIN required

 Metadata

Jenis Koleksi : eBooks
No. Panggil : e20396565
Entri utama-Nama orang :
Entri tambahan-Nama orang :
Subjek :
Penerbitan : Berlin: [Springer, ], 2012
Sumber Pengatalogan: LibUI eng rda
Tipe Konten: text
Tipe Media: computer
Tipe Pembawa: online resource
Deskripsi Fisik: x, 340 pages : illustration
Tautan: http://link.springer.com/book/10.1007%2F978-3-642-23929-8
Lembaga Pemilik:
Lokasi:
  • Ketersediaan
  • Ulasan
  • Sampul
No. Panggil No. Barkod Ketersediaan
e20396565 TERSEDIA
Ulasan:
Tidak ada ulasan pada koleksi ini: 20396565
Cover