Solving Multiactivity Multifacility Capacity-Constrained 0-1 Assignment Problems

Solving Multiactivity Multifacility Capacity-Constrained 0-1 Assignment Problems

4.11 - 1251 ratings - Source



A branch-and-bound solution algorithm and a computer program implementing this algorithm are developed to solve multiactivity multifacility capacity-constrained 0-1 assignment problems. Such 0-1 integer programming problems have the objective of minimizing the sum of variable costs due to the assignment of the activities to designs and fixed costs due to the inclusion of the facilities chosen. The constraints ensure that each activity is assigned to a single design and that the capacities of the facilities chosen are not exceeded. Each design involves the use of one or more facilities, and the same design may be used by several activities. This document includes formulation of the problem, mathematical development of the branch-and-bound solution algorithm, a detailed test example, and computational test results using the computer program. The areas of application are identified, and consideration for further improvement of the branch-and-bound solution algorithm are also included. (Author).A branch-and-bound solution algorithm and a computer program implementing this algorithm are developed to solve multiactivity multifacility capacity-constrained 0-1 assignment problems.


Title:Solving Multiactivity Multifacility Capacity-Constrained 0-1 Assignment Problems
Author: Krishan Lal Chhabra, GEORGE WASHINGTON UNIV WASHINGTON DC PROGRAM IN LOGISTICS., George Washington University. Institute for Management Science and Engineering, United States. Office of Naval Research
Publisher: - 1981
ISBN-13:

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.


Click button below to register and download Ebook
Privacy Policy | Contact | DMCA