Network of Scheduling Problems

CHF 61.50
Auf Lager
SKU
7DR3OM9NS3M
Stock 1 Verfügbar
Free Shipping Kostenloser Versand
Geliefert zwischen Mi., 05.11.2025 und Do., 06.11.2025

Details

Today we are living in a information technological age where computer networks are playing a big role. On the other hand due to globalization and complex competitive market situation the world s people are going with speed. The role of scheduling theory is increasing day by day in minimize the idle time of man and machine at work. The waiting time problem can be solve by using scheduling technique to meet the objective of the organization with efficiency and effectiveness. Manufacturing industries are the backbone in the economic structure of a nation. As the benefits from a manufacturing system can be maximized if the available resources are utilized in an optimize manner. Optimized utilization of resources can only be possible if there is a proper scheduling system in place. This makes scheduling a highly important aspect of a manufacturing system.

Autorentext
Dr. Deepak Gupta, a renowned personality,is working as a Prof. & Head,Dept.of Mathematics, MMU,Mullana, Haryana(India). He is prolific author of eleven books and has credit of 60 research papers published in National/International Journals. Ms. Payal Singla, M.Sc.,M.Phil., is a research scholar at MMU,working in the field of scheduling theory.

Cart 30 Tage Rückgaberecht
Cart Garantie

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783848486113
    • Sprache Englisch
    • Auflage Aufl.
    • Größe H6mm x B220mm x T150mm
    • Jahr 2012
    • EAN 9783848486113
    • Format Kartonierter Einband (Kt)
    • ISBN 978-3-8484-8611-3
    • Titel Network of Scheduling Problems
    • Autor Deepak Gupta , Payal Singla
    • Untertitel Flow Shop Scheduling
    • Gewicht 160g
    • Herausgeber LAP Lambert Academic Publishing
    • Anzahl Seiten 108
    • Genre Mathematik

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.