Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Sensitivity analysis of a railway station track layout with respect to a given timetable

Article Abstract:

A study was conducted to develop an algorithm for the sensitivity evaluation of a railway station track layout based on a given timetable. The algorithm supported the simulation of a Markov chain with a state space that is a subset of the set of feasible timetables. A set of integer variables and binary relations were analyzed to generate random solutions. Results indicated that the algorithm effectively carried out a sensitivity analysis on a given timeframe.

Author: Odijk, Michiel A.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Railroads, Rail Transportation, Management, Railroad management, Strategic planning (Business), Markov processes

User Contributions:

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

CAPTCHA


Single machine scheduling problem with fuzzy precedence relation

Article Abstract:

The single machine scheduling problem with fuzzy precedence relation is studied by means of nondominated schedule vectors and a solution algorithm. The problem is analyzed with regard to two objectives, namely, the maximum lateness to be minimized and the minimal satisfaction level with respect to fuzzy precedence relation to be maximized. Results indicate that the proposed algorithm is very useful for solving single machine scheduling problems.

Author: Ishii, Hiroaki, Tada, Minoru
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

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

CAPTCHA


Some new efficient methods to solve the n/1/r(i)/epsilon T(i) scheduling problem

Article Abstract:

New methods for solving the n/q/r(i)/epsilon T(i) or one-machine scheduling were derived when an adequate condition for local optimality was established. Newdominant subset of schedules and several approximate algorithms were defined based on this condition. Numerical experimentation enabled a comparison of these new algorithms with the classical approximate algorithms. An optimal solution is therefore possible in a smaller solution space.

Author: Chu, C., Portmann, M.-C.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992

User Contributions:

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

CAPTCHA


Subjects list: Research, Usage, Scheduling (Management), Algorithms
Similar abstracts:
  • Abstracts: Wheeling and dealing. Ships ahoy: Thailand struggles to build a merchant fleet. A political ploy
  • Abstracts: Revival of Sufism; mystical trend of Islam thriving again with demise of communism. Now, the bad news
  • Abstracts: Stranglehold loosens. John Hung's sales job: Hongkong's World International tries to reposition itself. Fields of fortune
  • Abstracts: Cost of indecision: Indonesia closes crisis-ridden Bank Summa. Fires of religious dissent
  • Abstracts: Number of bids, number of bidders and bidding behavior in outer-continental shelf oil lease auction markets. Heuristics for selecting robust database structures with dynamic query patterns
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.