Abstracts - faqs.org

Abstracts

Computers and office automation industries

Search abstracts:
Abstracts » Computers and office automation industries

Fixed Routes

Article Abstract:

The vehicle routing problem is considered, emphasizing the fixed route problem type. Routes are designed for delivery vehicles with known capacities, known customer location, and known demand. The fixed routes modeled have daily repetition. The problem is redefined to allow infeasible routes on certain days. Three heuristic solution methods are considered: reduction in a single day problem, an adapted savings algorithm, and an adapter r-optimal algorithm. An adapted algorithm is programmed. Computational results are given.

Author: Beasley, J.E.
Publisher: Macmillan Press Ltd.
Publication Name: Journal of the Operational Research Society
Subject: Computers and office automation industries
ISSN: 0160-5682
Year: 1984

User Contributions:

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

CAPTCHA


An Air Force Crew Allocation and Scheduling Problem

Article Abstract:

Two heuristic methods are developed to deal with allocation and scheduling in the United States Air Force. The resources are planes and crews. Factors involve sequence, starting times and manner in which the tasks are to be performed. The Two-Phase method fixes a sequence of missions for each plane before finding the schedule. The One-Phase method fixes the sequence of operations simultaneously with the simulation of the entire process. Tables and figures are given. An appendix presents data from Brooks Air Force Base.

Author: Sherali, H.D., Rios, M.
Publisher: Macmillan Press Ltd.
Publication Name: Journal of the Operational Research Society
Subject: Computers and office automation industries
ISSN: 0160-5682
Year: 1984
Artificial intelligence

User Contributions:

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

CAPTCHA


Linear Programming with Special Ordered Sets

Article Abstract:

Mathematical programming problems with maximization of a concave, separable, piecewise linear objective function subject to linear constraints are of special interest in production planning. They are usually worked with a simpler algorithm. Improvements to this procedure are developed using special structural features of the problems. Special ordered sets control pivoting operations. Tables and a graph are given.

Author: Snyder, R.D.
Publisher: Macmillan Press Ltd.
Publication Name: Journal of the Operational Research Society
Subject: Computers and office automation industries
ISSN: 0160-5682
Year: 1984

User Contributions:

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

CAPTCHA


Subjects list: Management science, Models, Operations Research
Similar abstracts:
  • Abstracts: All about assets. Swim with the Digerati
  • Abstracts: NEC touts mobile gear II handheld PCs while watching palm market. Canon homes digital technique for range of imaging products
  • Abstracts: Casio: Easy integration with Windows PC enhances terminal's convenience
  • Abstracts: Those Amazing Portables. Newsfront: Apple Makes Its Move into the Office with New Products, Lower Prices
  • Abstracts: Ikko Intros Line of Full-Featured Phones. Chalk Board Intros Six Packages with Overlays. Jensen Intros Computer Controlled Auto Receivers
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.