Name: Minimizing Idle Time of Selected Machines in Flowshop Problems (en Inglés)
Price: 222450.00 COP
Availability: InStock
Author: Pugazhenthi, R. ; Kalyana Chakravarthy, P. R.
ISBN: 9786206143239

portada Minimizing Idle Time of Selected Machines in Flowshop Problems (en Inglés)

Formato

Libro Físico

Autor

R. Pugazhenthi

P. R. Kalyana Chakravarthy

Editorial

LAP Lambert Academic Publishing

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

Dimensiones

22.9 x 15.2 x 0.5 cm

Peso

0.14 kg.

ISBN13

9786206143239

Categorías

Industria y estudios industriales

Minimizing Idle Time of Selected Machines in Flowshop Problems (en Inglés)

R. Pugazhenthi (Autor) · P. R. Kalyana Chakravarthy (Autor) · LAP Lambert Academic Publishing · Tapa Blanda

Libro Nuevo

$ 222.450

$ 370.750

Ahorras: $ 148.300

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Jueves 08 de Agosto y el Lunes 19 de Agosto.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Minimizing Idle Time of Selected Machines in Flowshop Problems (en Inglés)"

Scheduling in manufacturing systems involve allocation of resources spread over a time period to perform set of tasks.The problem of scheduling has been well researched in the past four decades considering the different situations of a manufacturing system. In this work the flow shop problem is considered with an objective of minimizing idle time of selected machines. Generally all the existing heuristics are developed to minimize the parameter like makespan time, flow time etc. In processing of jobs through machines, all machines are considered with equal importance. The first part of the research work made an attempt to improve the utilization of any one machine during processing. It can be achieved by reducing the idle time of the machine under consideration. The heuristic to be developed will improve the utilization of such selected machines. In order to validate the proposed heuristic, it is compared with the results of CDS method. The second part of the research work deal sequencing of jobs with priority is considered. It is assumed that among the available set of jobs few jobs will have priority and the remaining jobs are to be processed, after the processing priority jobs.