Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Scheduling preemptive jobs with precedence constraints on parallel machines

Article Abstract:

An approach was proposed to address the parallel machine scheduling problems. With regards to parallel machine scheduling problems with general precedence constraints, good lower bounds and near optimal solutions can be obtained by transforming the set of constraints into an interval order. Such can be achieved by extending or reducing the set of constraints. Scheduling problems that become NP-hard can be solved by approximating any partial order by an interval order which lessens a certain objective.

Author: Djellab, Khaled
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Analysis, Scheduling (Management), Heuristic programming

User Contributions:

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

CAPTCHA


The balanced linear programming problem

Article Abstract:

A problem enlargement prevention algorithm for the balanced linear programming problem (BLPP) is developed. The algorithm performs steps similar to those in the parametric simplex method and the adaptations to the network flow model reveals that the algorithm may be applied directly to the network without the need for simplex tableu maintenance. The algorithm solves the problem enlargement associated with BLPP transformations to standard linear programming form.

Author: Ahuja, Ravindra K.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Operations research, Management science, Reports

User Contributions:

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

CAPTCHA


Perfect, ideal and balanced matrices

Article Abstract:

Research into perfect, ideal and balanced matrices is presented. There are some cases in which the natural linear programming relaxation produces an optimal solution that is integer, thereby solving the problem. This research considers conditions under which this integrality property holds.

Author: Conforti, Michele, Cornuejols, Gerard, Kapoor, Ajai, Vuskovic, Kristina
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
Matrices, Matrices (Mathematics)

User Contributions:

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

CAPTCHA


Subjects list: Research, Linear programming
Similar abstracts:
  • Abstracts: Scheduling to minimize the total resource consumption with a constraint on the sum of completion times. A multicriteria heuristic method to improve resource allocation in multiproject scheduling
  • Abstracts: The teacher assignment problem: a special case of the fixed charge transportation problem. A quadratic programming approach to the determination of an upper bound on the weighed stability number
  • Abstracts: Real operating options and foreign direct investment: a synthetic approach. The Amsterdam Options Exchange in 1998: how the supervisory authorities turned a problem into a crisis
  • Abstracts: Water in, water out. Precipitation problems
  • Abstracts: Getting to them through their money. The financial front line. Cheap and trusted
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.