MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS: FLOWSHOP SCHEDULING Vol. 1 - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Résultats de recherche pour MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP...
Image fournie par le vendeur
MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS
Edité par
LAP LAMBERT Academic Publishing Feb 2023, 2023
ISBN 10 : 6206143236
ISBN 13 : 9786206143239
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 84 pp. Englisch. N° de réf. du vendeur 9786206143239
Acheter neuf
EUR 43,90
Expédition à EUR 23
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS
Edité par
LAP LAMBERT Academic Publishing Feb 2023, 2023
ISBN 10 : 6206143236
ISBN 13 : 9786206143239
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 84 pp. Englisch. N° de réf. du vendeur 9786206143239
Acheter neuf
EUR 43,90
Expédition à EUR 60
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS : FLOWSHOP SCHEDULING Vol. 1
Edité par
LAP LAMBERT Academic Publishing, 2023
ISBN 10 : 6206143236
ISBN 13 : 9786206143239
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N° de réf. du vendeur 9786206143239
Acheter neuf
EUR 44,59
Expédition à EUR 60,72
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS | FLOWSHOP SCHEDULING Vol. 1
Edité par
LAP LAMBERT Academic Publishing, 2023
ISBN 10 : 6206143236
ISBN 13 : 9786206143239
Neuf
Taschenbuch
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. MINIMIZING IDLE TIME OF SELECTED MACHINES IN FLOWSHOP PROBLEMS | FLOWSHOP SCHEDULING Vol. 1 | R. Pugazhenthi (u. a.) | Taschenbuch | Englisch | 2023 | LAP LAMBERT Academic Publishing | EAN 9786206143239 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. N° de réf. du vendeur 126665121
Acheter neuf
EUR 39,45
Expédition à EUR 70
Expédition depuis Allemagne vers Etats-Unis
Expédition depuis Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)