Verwandte Artikel zu Irreducibility on Open Shop Problem: Research on Open...
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
Reseña del editor:
Tribhuvan University Institute of Science and Technology Irreducibility on Open Shop Scheduling Problems Thesis Submitted to Central Department of Mathematics Kirtipur, Kathmandu, Nepal In partial fulfillment of the requirements for the Master's Degree in Mathematics by Raju Prasad Bhusal Date: March 2010 ABSTRACT We consider the classical open shop scheduling problem, where each job must be processed on each machine at least once. Our task is to determine the feasible combination of all job orders and machine orders minimizing the given objective function. Shop problems are modeled with the pair of mathematical models. As most of the problems belong to class NP-hard, our focus is to study the irreducibility theory and deal with the complexity of shop problem. There is no polynomial time algorithm for irreducibility test in general case but the problem is solved for two machines. We study some necessary and sufficient conditions for irreducibility and conclude that sourcesink irreducibility test is efficient among them. Moreover, irreducibility with implication classes and decomposition approach are studied. We study the generalized concept of irreducibility as dominance relation.
Biografía del autor:
Mr. Raju Prasad Bhusal has obtained his master’s degree in Mathematics in 2010as Gold Medalist. Since then he has worked in different national and internationalinstitution as a Lecturer and researcher in Mathematics. He has participated as aactive member in various Mathematical workshop and some other programmed.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagLAP Lambert Academic Publishing
- Erscheinungsdatum2011
- ISBN 10 3845470844
- ISBN 13 9783845470849
- EinbandTapa blanda
- Anzahl der Seiten160
Neu kaufen
Mehr zu diesem Angebot erfahren
EUR 63,22
Versand:
EUR 11,66
Von Vereinigtes Königreich nach USA
Beste Suchergebnisse bei AbeBooks
Beispielbild für diese ISBN
Irreducibility on Open Shop Problem
Verlag:
LAP Lambert Academic Publishing
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
Softcover
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783845470849_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 63,22
Währung umrechnen
Beispielbild für diese ISBN
Irreducibility on Open Shop Problem
Verlag:
LAP Lambert Academic Publishing 2011-09
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
PF
Anzahl: 10
Anbieter:
Bewertung
Buchbeschreibung PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783845470849
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 59,03
Währung umrechnen
Beispielbild für diese ISBN
Irreducibility on Open Shop Problem: Research on Open Shop Problem
Verlag:
LAP LAMBERT Academic Publishing
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
Softcover
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLING22Oct2817100620644
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 73,14
Währung umrechnen
Foto des Verkäufers
Irreducibility on Open Shop Problem
Verlag:
LAP LAMBERT Academic Publishing Sep 2011
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
Taschenbuch
Anzahl: 2
Anbieter:
Bewertung
Buchbeschreibung Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Tribhuvan University Institute of Science and Technology Irreducibility on Open Shop Scheduling Problems Thesis Submitted to Central Department of Mathematics Kirtipur, Kathmandu, Nepal In partial fulfillment of the requirements for the Master's Degree in Mathematics by Raju Prasad Bhusal Date: March 2010 ABSTRACT We consider the classical open shop scheduling problem, where each job must be processed on each machine at least once. Our task is to determine the feasible combination of all job orders and machine orders minimizing the given objective function. Shop problems are modeled with the pair of mathematical models. As most of the problems belong to class NP-hard, our focus is to study the irreducibility theory and deal with the complexity of shop problem. There is no polynomial time algorithm for irreducibility test in general case but the problem is solved for two machines. We study some necessary and sufficient conditions for irreducibility and conclude that sourcesink irreducibility test is efficient among them. Moreover, irreducibility with implication classes and decomposition approach are studied. We study the generalized concept of irreducibility as dominance relation. 160 pp. Englisch. Bestandsnummer des Verkäufers 9783845470849
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 59,00
Währung umrechnen
Beispielbild für diese ISBN
Irreducibility on Open Shop Problem Research on Open Shop Problem
Verlag:
LAP LAMBERT Academic Publishing
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
PAP
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9783845470849
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 87,89
Währung umrechnen
Foto des Verkäufers
Irreducibility on Open Shop Problem : Research on Open Shop Problem
Verlag:
LAP LAMBERT Academic Publishing
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
Taschenbuch
Anzahl: 1
Anbieter:
Bewertung
Buchbeschreibung Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Tribhuvan University Institute of Science and Technology Irreducibility on Open Shop Scheduling Problems Thesis Submitted to Central Department of Mathematics Kirtipur, Kathmandu, Nepal In partial fulfillment of the requirements for the Master's Degree in Mathematics by Raju Prasad Bhusal Date: March 2010 ABSTRACT We consider the classical open shop scheduling problem, where each job must be processed on each machine at least once. Our task is to determine the feasible combination of all job orders and machine orders minimizing the given objective function. Shop problems are modeled with the pair of mathematical models. As most of the problems belong to class NP-hard, our focus is to study the irreducibility theory and deal with the complexity of shop problem. There is no polynomial time algorithm for irreducibility test in general case but the problem is solved for two machines. We study some necessary and sufficient conditions for irreducibility and conclude that sourcesink irreducibility test is efficient among them. Moreover, irreducibility with implication classes and decomposition approach are studied. We study the generalized concept of irreducibility as dominance relation. Bestandsnummer des Verkäufers 9783845470849
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 59,00
Währung umrechnen
Beispielbild für diese ISBN
Irreducibility on Open Shop Problem Research on Open Shop Problem
Verlag:
LAP LAMBERT Academic Publishing
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
PAP
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9783845470849
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 65,37
Währung umrechnen
Foto des Verkäufers
Irreducibility on Open Shop Problem
Verlag:
LAP LAMBERT Academic Publishing
(2011)
ISBN 10: 3845470844
ISBN 13: 9783845470849
Neu
Softcover
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers 5483919
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 48,50
Währung umrechnen