Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: preigu, Osnabrück, Germania
EUR 36,25
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. n X 2 Flow Shop Scheduling | Minimization of Total Waiting Time of Jobs | Bharat Goyal | Taschenbuch | 60 S. | Englisch | 2020 | LAP LAMBERT Academic Publishing | EAN 9786200534019 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing Jan 2020, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 39,90
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The book covers up the basic concepts of Operations research and scheduling theory and focuses on 'n' job '2' machine Flow Shop Scheduling, where the times to process the jobs are not at the whole arbitrary but have a definite relation with one another. It is assumed the minimum of the times to process the jobs on second machine can never be less than the maximum of the times to process the jobs on the first machine. The main intention of the study is to lessen the total of the times spent in waiting by all the jobs. 60 pp. Englisch.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: Majestic Books, Hounslow, Regno Unito
EUR 64,21
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 64,43
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: moluna, Greven, Germania
EUR 34,25
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Goyal BharatDr. Deepak Gupta, Professor and Head, Department of Mathematics, Maharishi Markandeshwar (Deemed to be University), Mullana, Haryana, India has more than 200 research papers and 20 books to his credit.Dr. Bharat Goyal, De.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing Jan 2020, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 39,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The book covers up the basic concepts of Operations research and scheduling theory and focuses on 'n' job '2' machine Flow Shop Scheduling, where the times to process the jobs are not at the whole arbitrary but have a definite relation with one another. It is assumed the minimum of the times to process the jobs on second machine can never be less than the maximum of the times to process the jobs on the first machine. The main intention of the study is to lessen the total of the times spent in waiting by all the jobs.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch.
Lingua: Inglese
Editore: LAP LAMBERT Academic Publishing, 2020
ISBN 10: 6200534012 ISBN 13: 9786200534019
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 40,89
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The book covers up the basic concepts of Operations research and scheduling theory and focuses on 'n' job '2' machine Flow Shop Scheduling, where the times to process the jobs are not at the whole arbitrary but have a definite relation with one another. It is assumed the minimum of the times to process the jobs on second machine can never be less than the maximum of the times to process the jobs on the first machine. The main intention of the study is to lessen the total of the times spent in waiting by all the jobs.