{"product_id":"irreducibility-on-open-shop-problem-von-raju-prasad-bhusal","title":"Irreducibility on Open Shop Problem","description":"\u003cp\u003eTribhuvan 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783845470849\"\u003e\u003ch3\u003eResearch on Open Shop Problem\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783845470849","offer_id":39471318302813,"sku":"9783845470849","price":59.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/0dc13d8d-0a93-41a7-a084-0a84289f23a1.jpg?v=1756186476","url":"https:\/\/shop.autorenwelt.de\/products\/irreducibility-on-open-shop-problem-von-raju-prasad-bhusal","provider":"Autorenwelt Shop","version":"1.0","type":"link"}