Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Analysis of the temporal decomposition procedure for scheduling with release and due dates

Article Abstract:

Decomposition procedure brings substantial effects when some conditions on scheduling parameters are met. The complexity of a scheduling algorithm utilizing decomposed subsets is inversely proportional with that of the decomposition procedure, thus the efficiency of the total scheduling algorithm is strongly affected by the decomposability of the set of operations to be processed on each machine. Furthermore, a procedure of temporal decomposition based on precedence relations over operations can decrease the searching space of scheduling problems.

Author: Happiette, Michel, Rabensalo, Besoa, Zeng, Xianyi
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
Management Dynamics NEC, Management techniques, Decomposition method

User Contributions:

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

CAPTCHA


A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

Article Abstract:

An approximation algorithm for discovering the minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size is proposed. The algorithm is based on the notion of simulated annealing to solve the sequential partitioning problem or OSP and uses the random compound move as search diversification. The use of the simulated annealing technique in conjunction with the random compound move can be applied to obtain estimated solutions of good quality for a broad range of sequential partitioning problems.

Author: Kaji, Taichi, Ohuchi, Azuma
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Evaluation, Mathematical models, Graph theory, Numerical calculations, Partitions (Mathematics)

User Contributions:

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

CAPTCHA


Aircrew schedule generation using repeated matching

Article Abstract:

A study presents an optimization-based approach to solving aircrew flight schedule problems. The approach uses repeated matching algorithm to generate optimal pairing and rostering schedules. Actual airline application of the approach reveal an effective schedule generated through repeated matching algorithm that can ensure efficient utilization of crew resources contributing largely to reduction of an airline's operating costs.

Author: Holt, John, Ronnqvist, Mikael, Ryan, David, Wark, Peter
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Work Schedules, Work hours, Calendar, Air pilots, Aircraft pilots, Matching theory

User Contributions:

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

CAPTCHA


Subjects list: Models, Analysis, Scheduling (Management), Algorithms
Similar abstracts:
  • Abstracts: A tale of two buyouts. Independent corporate finance advice for Kent and the south-east
  • Abstracts: A two-echelon allocation model and the value of information under correlated forecasts and demands. part 2 Pre-processing techniques for resource allocation in the heterogenous case
  • Abstracts: Rolling the Lords: Scottish devolution. To sir, with confusion
  • Abstracts: Heavyweight trips the light fantastic. Getting it white - and counting the cost. Railway system with a starring role in Malaysia
  • Abstracts: The last pinball machine. Please adjust your set. Father knows: Russian industry
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.