Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

Problem Formulation in Planning and Design

Article Abstract:

Defining the problem is the main theme. A 'problem-purpose expansion' technique is examined for its effectiveness in reformulating problems. The factors in the defining of problems are discussed, as well as some strategies for reducing complexities in diagnosis. Two groups of students, each divided into high and low creativity groups, brainstormed with and without the 'problem- purpose expansion' technique. The results, compared to a control group, showed that the technique helped the highly creative participants to come up with thirty-three per cent more solutions to the problem. Suggestions about further research are given. Two appendices show the technique and the problems used.

Author: Volkema, R.J.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1983
Business planning, Design, Systems development, Creativity, Brainstorming, System Development, Definitions, Problem Complexity, Reducibility, Project Conception

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities

Article Abstract:

An assembly line balancing problem with nine modifications is discussed. The objective is to minimize the required number of assembly stations, given a cycle time, a set of tasks with deterministic performance times, and between-task precedence relationships. An algorithm which solves problems conforming to the modified formulation is presented.

Author: Johnson, R.V.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1983
Manufacturing, Applications, Assembly Line

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


On Balut's Algorithm and NP-Completeness for a Chance- Constrained Scheduling Problem

Article Abstract:

In 1973, Balut presented an algorithm to solve an n-job one machine scheduling problem. Random procession times are used to minimize the number of tardy jobs. However, the algorithm does not give an optimal schedule. The problem can be shown to be NP- complete so there does not seem to exist any such efficient algorithm.

Author: Kise, H., Ibaraki, T.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1983
Statistics (Data), Optimization, Stochastic Model, Statistics, NP-Complete Problems

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Management science, Algorithms, Algorithm, Production, Scheduling
Similar abstracts:
  • Abstracts: Simulation-based estimation of proportions. A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
  • Abstracts: Probabilistic analyses and algorithms for three-level distribution systems. Inventory rationing in a make-to-stock production system with several demand classes and lost sales
  • Abstracts: The workplace revolution; jobs have become far more demanding, and workers must think in different ways and adapt to unpredictable changes
  • Abstracts: New Products: Focus on Phones. Facelift for Beauty Products Company
  • Abstracts: Tackling Micro-Mainframe Incompatibility Problems. A Portable Micro from Japan
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.