Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Project management and scheduling

Article Abstract:

Scheduling is the optimal allocation of limited resources to activities over time. Most applications involve machines as the limited resources and therefore machine scheduling is the optimal allocation of machines to do several activities or jobs. Machines can be classified either as single machines, identical parallel machines, uniform parallel machines and unrelated parallel machines. Since some problems are so complex, heuristic search methodologies have been developed to provide near-optimal solutions at reasonable computational expenses.

Author: Demeulemeester, Erik L., Herroelen, Willy S.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Editorial, Analysis

User Contributions:

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

CAPTCHA


Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times

Article Abstract:

A study was conducted to obtain approximation algorithms for the classic scheduling problem. A single-machine scheduling problem was considered in which each job has a processing and delivery time, each set of jobs is divided into batches and a setup time is incurred everytime there is a switch from a job in one batch to a job in another batch. Two approximation alogorithms with a 3 2 worst-case performance ratio were obtained for the regime of sequence independent batch setup times.

Author: Zdrzalka, Stanislaw
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Queuing theory

User Contributions:

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

CAPTCHA


Modelling setup times, process batches and transfer batches using activity network logic

Article Abstract:

Theoretical models for generalized resource-constrained project scheduling are combined with activity network logic to solve production scheduling problems that involve setup times, transfer batches and process batches. Computations are performed using the branch-and-bound procedure to determine an optimal scheduling concept. Results indicate that the use of the scheduling models and activity network logic allows greater flexibility in production planning.

Author: Demeulemeester, Erik L., Herroelen, Willy S.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Production planning

User Contributions:

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

CAPTCHA


Subjects list: Project management, Scheduling (Management), Research, Models
Similar abstracts:
  • Abstracts: Maintenance management decision making. Integrating optimisation, priority setting, planning and combining of maintenance activities
  • Abstracts: The complexity of a cyclic scheduling problem with identical machines and precedence constraints. Job-shop scheduling: computational study of local search and large-step optimization methods
  • Abstracts: The impact of human resource management on organisational performance: theory and research. A framework for diagnosing human resource management practices
  • Abstracts: Heuristics and exact algorithms for solving the Monden problem. Exact and heuristic algorithms for data sets reconstruction
  • Abstracts: Rothschild calls for greater Lottery philanthropy. Allies and Morrison benefits from latest Arts lottery cash
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.