Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by LAP Lambert Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by LAP Lambert Academic Publishing 2011-09, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: Chiron Media, Wallingford, United Kingdom
Book
PF. Condition: New.
Published by LAP LAMBERT Academic Publishing Sep 2011, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. Condition: 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.
Published by LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Book Print on Demand
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book Print on Demand
Taschenbuch. Condition: 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.
Published by LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Book Print on Demand
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: moluna, Greven, Germany
Book
Condition: New.
Published by LAP LAMBERT Academic Publishing, 2011
ISBN 10: 3845470844ISBN 13: 9783845470849
Seller: dsmbooks, Liverpool, United Kingdom
Book
Paperback. Like New Like New. Ships from multiple Locations. book.