Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

The gamma-connected assignment problem

Article Abstract:

A study was conducted to formulate a solution to the gamma-connected assignment problem that requires the determination of a minimum cost assignment of each vertex in V with exactly one color in K in a way that no color q stimulates a subgraph with more than a given number of connected components. A dynamic programming algorithm was developed to solve this NP-hard problem. The proposed algorithm shows that the gamma-connected assignment problem is solvable in polynomial time. Mixed-integer programming formulations were also proposed.

Author: Aragao, Marcus Poggi de, Uchoa, Eduardo
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Methods, Decision-making, Decision making, Optimization theory, Mathematical programming

User Contributions:

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

CAPTCHA


Random sequencing jobs with deadlines problem: growth of the optimal solution values

Article Abstract:

A probabilistic analysis of sequencing job with deadlines (SJD) problem finds that obtained estimation of the optimal solution value could be very useful in formulating and testing the approximate algorithms for solving the SJD problem. The study focused on the growth of optimal solutions values and also finds that the asymptotical value of the random SJD problem is determined by the 'increments of the deadlines.'

Author: Szkatula, Krzysztof
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Production Planning & Control, Analysis, Production management, Production control

User Contributions:

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

CAPTCHA


A note on sequencing jobs with deadlines problem

Article Abstract:

Two simple heuristic algorithms for solving the sequencing jobs with deadlines problem are presented. A threshold algorithm (H1) and algorithm H2 based on linear programming relaxation prove to behave similarly for uncorrelated and correlated problems for small sizes up to 100 to 200. Both H1 and H2, perform faster than the greedy algorithm, although H2 and the greedy algorithm yield better results than H1.

Author: Dudzinski, Krzysztof, Szkatula, Krzysztof
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Models

User Contributions:

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

CAPTCHA


Subjects list: Usage, Algorithms, Integer programming, Scheduling (Management)
Similar abstracts:
  • Abstracts: Sequential location problems. On a pattern sequencing problem to minimize the maximum number of open stacks. Branch-and-bound algorithms for the multi-product assembly line balancing problem
  • Abstracts: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Modeling and solving the periodic maintenance problem
  • Abstracts: Tailored to fit. News-stand stars: sports dailies catch commuters' fancy
  • Abstracts: A fuzzy-linguistic approach to a multi-criteria sequencing problem. Application of a measure of proximity to fuzzy control algorithms
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.