Isbn: 9781332901890 - some problems in linear graph theory that arise in the analysis of the sequencing of jobs through machines (classic reprint) (3 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (3)

  • Nuevo (3)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Forgotten Books, 2018

    1332901891 / 9781332901890

    • Tapa blanda

    Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 25,71

     Gastos de envío gratis 
    Se envía dentro de Estados Unidos de America

    Cantidad disponible: 15 disponibles

    PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

  • Idioma: Inglés

    Editorial: Forgotten Books, 2018

    1332901891 / 9781332901890

    • Tapa blanda

    Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 24,90

    Envío por EUR 3,87 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 15 disponibles

    PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

  • Más imágenes

    Idioma: Inglés

    Editorial: Forgotten Books, 2018

    1332901891 / 9781332901890

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Forgotten Books, London, Reino UnidoForgotten Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 16,16

     Gastos de envío gratis 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: New. Print on Demand. This book is an analysis of scheduling problems in manufacturing and computing. It explores the linear graph theory framework for understanding the sequencing of jobs through machines, framing these problems in terms of a novel approach of specifying scheduling constraints. The author demonstrates methods of constructing transitive graphs from component graphs by connecting components with directed branches. This allows the chains containing a given machine designation to be simply ordered, and the sets of jobs to have the same ordering as the component. This approach is novel as it allows for efficient algorithms for the construction of transitive graphs using digital computers, and facilitates the study of the construction and counting of transitive schedule graphs. By characterizing the properties of these graphs, the text makes an important contribution to understanding the relationship between technological ordering and the construction of feasible schedules, and in turn the study of the function of schedule time. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…