Stock Image

Irreducibility on Open Shop Problem

Raju Prasad Bhusal

ISBN 10: 3845470844 / ISBN 13: 9783845470849
Published by LAP LAMBERT Academic Publishing
New Condition: New Soft cover
From BuySomeBooks (Las Vegas, NV, U.S.A.)

AbeBooks Seller Since May 21, 2012

Quantity Available: 20
Buy New
List Price: US$ 80.00
Price: US$ 123.96 Convert Currency
Shipping: US$ 3.95 Within U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy


About this Item

Paperback. 160 pages. Dimensions: 8.7in. x 5.9in. x 0.4in.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 Masters 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Bookseller Inventory # 9783845470849

Ask Seller a Question

Bibliographic Details

Title: Irreducibility on Open Shop Problem

Publisher: LAP LAMBERT Academic Publishing

Binding: Paperback

Book Condition:New

Book Type: Paperback

About this title

Synopsis:

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.

About the Author:

Mr. Raju Prasad Bhusal has obtained his master’s degree in Mathematics in 2010as Gold Medalist. Since then he has worked in different national and internationalinstitution as a Lecturer and researcher in Mathematics. He has participated as aactive member in various Mathematical workshop and some other programmed.

"About this title" may belong to another edition of this title.

Store Description

BuySomeBooks is great place to get your books online. With over eight million titles available we're sure to have what you're looking for. Despite having a large selection of new books available for immediate shipment and excellent customer service, people still tell us they prefer us because of our prices.

Visit Seller's Storefront

Terms of Sale:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

BuySomeBooks is operated by Drive-On-In, Inc., a Nevada co...

More Information
Shipping Terms:

Orders usually ship within 1-2 business days. Books are shipped from multiple locations so your order may arrive from Las Vegas,NV, Roseburg,OR, La Vergne,TN, Momence,IL, or Commerce,GA.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express