Balancing a U-Shaped Assembly Line by Applying Nested Partitions Method

PDF Version Also Available for Download.

Description

In this study, we applied the Nested Partitions method to a U-line balancing problem and conducted experiments to evaluate the application. From the results, it is quite evident that the Nested Partitions method provided near optimal solutions (optimal in some cases). Besides, the execution time is quite short as compared to the Branch and Bound algorithm. However, for larger data sets, the algorithm took significantly longer times for execution. One of the reasons could be the way in which the random samples are generated. In the present study, a random sample is a solution in itself which requires assignment of ... continued below

Physical Description

1406 KB

Creation Information

Bhagwat, Nikhil V. December 17, 2005.

Context

This thesis or dissertation is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 66 times . More information about this document can be viewed below.

Who

People and organizations associated with either the creation of this thesis or dissertation or its content.

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this thesis or dissertation. Follow the links below to find similar items on the Digital Library.

Description

In this study, we applied the Nested Partitions method to a U-line balancing problem and conducted experiments to evaluate the application. From the results, it is quite evident that the Nested Partitions method provided near optimal solutions (optimal in some cases). Besides, the execution time is quite short as compared to the Branch and Bound algorithm. However, for larger data sets, the algorithm took significantly longer times for execution. One of the reasons could be the way in which the random samples are generated. In the present study, a random sample is a solution in itself which requires assignment of tasks to various stations. The time taken to assign tasks to stations is directly proportional to the number of tasks. Thus, if the number of tasks increases, the time taken to generate random samples for the different regions also increases. The performance index for the Nested Partitions method in the present study was the number of stations in the random solutions (samples) generated. The total idle time for the samples can be used as another performance index. ULINO method is known to have used a combination of bounds to come up with good solutions. This approach of combining different performance indices can be used to evaluate the random samples and obtain even better solutions. Here, we used deterministic time values for the tasks. In industries where majority of tasks are performed manually, the stochastic version of the problem could be of vital importance. Experimenting with different objective functions (No. of stations was used in this study) could be of some significance to some industries where in the cost associated with creation of a new station is not the same. For such industries, the results obtained by using the present approach will not be of much value. Labor costs, task incompletion costs or a combination of those can be effectively used as alternate objective functions.

Physical Description

1406 KB

Subjects

Language

Identifier

Unique identifying numbers for this document in the Digital Library or other systems.

  • Report No.: IS-T 2504
  • Grant Number: W-7405-Eng-82
  • Office of Scientific & Technical Information Report Number: 861605
  • Archival Resource Key: ark:/67531/metadc791912

Collections

This document is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this thesis or dissertation?

When

Dates and time periods associated with this thesis or dissertation.

Creation Date

  • December 17, 2005

Added to The UNT Digital Library

  • Dec. 19, 2015, 7:14 p.m.

Description Last Updated

  • Sept. 21, 2017, 8:02 p.m.

Usage Statistics

When was this document last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 66

Interact With This Thesis Or Dissertation

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Bhagwat, Nikhil V. Balancing a U-Shaped Assembly Line by Applying Nested Partitions Method, thesis or dissertation, December 17, 2005; Ames, Iowa. (digital.library.unt.edu/ark:/67531/metadc791912/: accessed November 19, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.