Irreducibility on Open Shop Problem: Research on Open Shop Problem,Used

Irreducibility on Open Shop Problem: Research on Open Shop Problem,Used

In Stock
SKU: DADAX3845470844
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$102.53
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 NPhard, 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed