"synopsis" may belong to another edition of this title.
"About this title" may belong to another edition of this title.
Shipping:
US$ 12.33
From United Kingdom to U.S.A.
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783845470849_lsuk
Book Description Condition: New. Seller Inventory # ABLING22Oct2817100620644
Book Description PF. Condition: New. Seller Inventory # 6666-IUK-9783845470849
Book Description 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. Seller Inventory # 9783845470849
Book Description PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9783845470849
Book Description 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. Seller Inventory # 9783845470849
Book Description 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. Seller Inventory # L0-9783845470849
Book Description Condition: New. Seller Inventory # 5483919
Book Description Condition: New. First Edition. First Edition thus. Irreducibility on Open Shop Problem by Raju Prasad Bhusal. ISBN:9783845470849. Collectible item in excellent condition. Seller Inventory # 3845470849