Model algorithms scheduling uniform de senthilkumar (10 resultados)
- Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 11,96
Envío por EUR 2,30Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa blanda
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 12,62
Envío por EUR 2,30Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa blanda
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 13,52
Envío por EUR 13,80Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa blanda
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 13,50
Envío por EUR 17,28Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
- Tapa blanda
Librería: GreatBookPricesUK, Woodford Green, Reino UnidoGreatBookPricesUK
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 15,73
Envío por EUR 17,28Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
- Tapa blanda
- Impresión bajo demanda
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 14,33
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: new. Paperback. Production scheduling helps businesses become more productive and efficiently satisfy consumer needs. Because it falls within the combinatorial category, scheduling work on uniform parallel computers to minimize the makespan measure is a difficult problem under single machine scheduling. The… goal of this essay is to show how to design an effective algorithm for this particular situation.The introduction chapter of this text covers single machine scheduling with a single machine, single machine scheduling with parallel machines, and research gap of unform parallel machine scheduling.The goals of the challenge, the assumptions behind the scheduling of uniform parallel machines, and the plan for developing the algorithms are all presented in Chapter 2, which describes the problem. A model and an example of the model utilizing a small size problem are provided in Chapter 3 on the mathematical model for uniform parallel machines scheduling to minimize makespan. The simulated annealing algorithm to minimize makespan in the single machine scheduling problem with uniform parallel machines is presented in Chapter 4. It includes an overview of the algorithm, its skeleton, three newly developed simulated annealing algorithms, and a comparison of them to determine which is the best.The development of a GA-based strategy to reduce the uniform parallel machine scheduling makespan is presented in Chapter 5. This covers the basic structure of the genetic algorithm, factors that impact the GA algorithm, techniques for assigning tasks to machines, and crossover strategies. Additionally, it entails the creation of four GA-based heuristics to reduce makespan and a comparison of them to determine which GA-based heuristic is optimum for scheduling jobs on uniform parallel computers.In order to determine which is optimal, the best GA-based heuristic and the best simulated annealing technique are compared in Chapter 6 to minimize the makespan of scheduling jobs on uniform parallel computers. Appendix 1 for replication 1 and Appendix 2 for replication 2 contain the data needed to test the heuristics in Chapter 4, Chater 5, and Chapter 6.The author expresses gratitude to all of his university colleagues and academicians for their support in releasing this work. The writing style of this text is simple to read. P. Senthilkumar, B.E., M.E., Ph.D This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
- Tapa blanda
- Impresión bajo demanda
Librería: California Books, Miami, FL, Estados Unidos de AmericaCalifornia Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 14,38
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. Print on Demand.
- Tapa blanda
- Impresión bajo demanda
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 16,24
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Tapa blanda
- Impresión bajo demanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 15,01
Envío por EUR 3,79Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Tapa blanda
- Impresión bajo demanda
Librería: CitiRetail, Stevenage, Reino UnidoCitiRetail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 18,38
Envío por EUR 42,63Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: new. Paperback. Production scheduling helps businesses become more productive and efficiently satisfy consumer needs. Because it falls within the combinatorial category, scheduling work on uniform parallel computers to minimize the makespan measure is a difficult problem under single machine scheduling. The… goal of this essay is to show how to design an effective algorithm for this particular situation.The introduction chapter of this text covers single machine scheduling with a single machine, single machine scheduling with parallel machines, and research gap of unform parallel machine scheduling.The goals of the challenge, the assumptions behind the scheduling of uniform parallel machines, and the plan for developing the algorithms are all presented in Chapter 2, which describes the problem. A model and an example of the model utilizing a small size problem are provided in Chapter 3 on the mathematical model for uniform parallel machines scheduling to minimize makespan. The simulated annealing algorithm to minimize makespan in the single machine scheduling problem with uniform parallel machines is presented in Chapter 4. It includes an overview of the algorithm, its skeleton, three newly developed simulated annealing algorithms, and a comparison of them to determine which is the best.The development of a GA-based strategy to reduce the uniform parallel machine scheduling makespan is presented in Chapter 5. This covers the basic structure of the genetic algorithm, factors that impact the GA algorithm, techniques for assigning tasks to machines, and crossover strategies. Additionally, it entails the creation of four GA-based heuristics to reduce makespan and a comparison of them to determine which GA-based heuristic is optimum for scheduling jobs on uniform parallel computers.In order to determine which is optimal, the best GA-based heuristic and the best simulated annealing technique are compared in Chapter 6 to minimize the makespan of scheduling jobs on uniform parallel computers. Appendix 1 for replication 1 and Appendix 2 for replication 2 contain the data needed to test the heuristics in Chapter 4, Chater 5, and Chapter 6.The author expresses gratitude to all of his university colleagues and academicians for their support in releasing this work. The writing style of this text is simple to read. P. Senthilkumar, B.E., M.E., Ph.D This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
