Isbn: 9783659690013 - metaheuristics for fjssp problems (6 risultati)

Perfeziona la tua ricerca

  • Libri (6)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: LAP LAMBERT Academic Publishing, 2015

    3659690015 / 9783659690013

    • Brossura

    Da: preigu, Osnabrück, Germaniapreigu

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 61,05

    EUR 70,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 5 disponibili

    Taschenbuch. Condizione: Neu. Metaheuristics for FJSSP Problems | Muthukannan Rajkumar (u. a.) | Taschenbuch | 176 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659690013 | 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, 2015

    3659690015 / 9783659690013

    • Brossura

    Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books

    Venditore con 4 stelle
    Contatta il venditore

    Condizione: Usato - Come nuovo

    EUR 163,36

    EUR 29,15 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 1 disponibili

    Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

  • Lingua: Inglese

    Editore: LAP LAMBERT Academic Publishing Apr 2015, 2015

    3659690015 / 9783659690013

    • Brossura
    • Print on Demand

    Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 71,90

    EUR 23,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 2 disponibili

    Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Scheduling problems occur in all economic domains from computer engineering to manufacturing techniques. These problems are generally defined as decision making problems with the aim of optimizing one or more scheduling criteria. Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. It is more complex than job shop scheduling problem, because of the additional need to determine the assignment of operations to machines. FJSSP is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution with the traditional techniques. In this connection, suitable algorithms (or) techniques are required to solve the FJSSP. This book provides wide knowledge in the metaheuristics with scheduling field. 176 pp. Englisch.

  • Lingua: Inglese

    Editore: LAP LAMBERT Academic Publishing, 2015

    3659690015 / 9783659690013

    • Brossura
    • Print on Demand

    Da: moluna, Greven, Germaniamoluna

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 58,12

    EUR 48,99 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: Più di 20 disponibili

    Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Rajkumar MuthukannanDr.M.Rajkumar has acquired Ph.D.(Production Engineering)from National Institute of Technology,Tiruchirappalli,India in 2011 and Master of Engineering (Manufacturing Engineering) from Anna University,Chennai in 200.

  • Lingua: Inglese

    Editore: LAP LAMBERT Academic Publishing Apr 2015, 2015

    3659690015 / 9783659690013

    • Brossura
    • Print on Demand

    Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 71,90

    EUR 60,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Scheduling problems occur in all economic domains from computer engineering to manufacturing techniques. These problems are generally defined as decision making problems with the aim of optimizing one or more scheduling criteria. Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. It is more complex than job shop scheduling problem, because of the additional need to determine the assignment of operations to machines. FJSSP is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution with the traditional techniques. In this connection, suitable algorithms (or) techniques are required to solve the FJSSP. This book provides wide knowledge in the metaheuristics with scheduling field.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 176 pp. Englisch.

  • Lingua: Inglese

    Editore: LAP LAMBERT Academic Publishing, 2015

    3659690015 / 9783659690013

    • Brossura
    • Print on Demand

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 71,90

    EUR 61,40 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Scheduling problems occur in all economic domains from computer engineering to manufacturing techniques. These problems are generally defined as decision making problems with the aim of optimizing one or more scheduling criteria. Flexible Job Shop Scheduling Problem (FJSSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. It is more complex than job shop scheduling problem, because of the additional need to determine the assignment of operations to machines. FJSSP is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution with the traditional techniques. In this connection, suitable algorithms (or) techniques are required to solve the FJSSP. This book provides wide knowledge in the metaheuristics with scheduling field.