Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Irreducibility on Open Shop Problem

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 4,396

Availability: In stock

 
  • Product Description
 

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.

Product Specifications
SKU :COC99284
AuthorRaju Prasad Bhusal
LanguageEnglish
BindingPaperback
Number of Pages160
Publishing Year2011-09-22T00:00:00.000
ISBN978-3845470849
Edition1 st
Book TypeMathematics & science
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-08-18 00:00:00