Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Audit scheduling with overlapping activities and sequence-dependent setup costs

Article Abstract:

Audit staff scheduling problems that take into account the overlapping relationships between audit activities and the changeover times and costs for the auditors are discussed. Specifically, the problem is characterized as an integer linear program (ILP) based on an activity network with lead/lag relationships to minimize the number of decision variables. The ILP model, which is implemented in a four-auditor two-engagement example, results in lower cost schedules and audits.

Author: Dodin, Bajis, Elimam, A.A.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Management, Auditing

User Contributions:

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

CAPTCHA


Optimizing nuclear power plant refueling with mixed-integer programming

Article Abstract:

Computational experiments involving that of scheduling the shutdown of nuclear power plant for refueling and maintenance activities are discussed. Single-site and multi-site problems were considered under site and demand constraints. The problem, which becomes difficult to solve as the number of reactors increases, may be solved using a branch-and-bound search, a price-directed decomposition method and other mixed-integer programming techniques.

Author: Fourcade, Fabrice, Johnson, Ellis, Bara, Mourad, Cortey-Dumont, Philippe
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Plant maintenance, Factory maintenance

User Contributions:

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

CAPTCHA


Solving large scale crew scheduling problems

Article Abstract:

Sabre Decision Technologies' Crew_Solve optimization algorithm for solving American Airlines' crew pairing problem enabled the airline to minimize costs by improving crew utilization and reducing pay and credit. The procedure, which recast the problem as a set partitioning zero-one integer program, employs linear program relaxations to trim the search tree and a graph-based branching heuristic to a 15,000-column set partitioning subproblem.

Author: Johnson, Ellis L., Chu, Hai D., Gelman, Eric
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Partitions (Mathematics)

User Contributions:

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

CAPTCHA


Subjects list: Operations research, Research, Management science, Case studies, Scheduling (Management), Integer programming
Similar abstracts:
  • Abstracts: Discrete NT-policy single server queue with Markovian arrival process and phase type service. The G/G/1 (LCFS/P) queue with service depending on queue size
  • Abstracts: Shedding light on Megawati. Family and friends. Political engineering
  • Abstracts: On the complexity of scheduling with large communication delays. A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
  • Abstracts: Adapt or perish. The birth of an investment trust
  • Abstracts: Seven arched spans were designed to give a clear view and pleasing reflections in the estuary. Stirling Prize 2001: seven to fight it out
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.