Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Resource-constrained project scheduling: notation, classification, models, and methods

Article Abstract:

A classification model specifying the resource environment, activity characteristics and an objective function is developed for the resource-constrained project scheduling problem. The absence of a standardized form for notation and classification remains a problem in terms of bridging the gap between machine scheduling and project scheduling. Although constraint-propagation methods have been developed, tests indicate that different models still require specific methods depending on the given problem.

Author: Drexl, Andreas, Brucker, Peter, Pesch, Erwin, Neumann, Klaus, Mohring, Rolf
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Operations research, Management science, Models, Production control

User Contributions:

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

CAPTCHA


A new lower bound for the job-shop scheduling problem

Article Abstract:

A novel procedure for the calculation of lower bounds for the job scheduling program based on two-job relaxations is presented. These lower bounds provide better results than classical lower bounds dependent on one-machine relaxations for small job-to-machine ratios. This method is also applicable to generalized job-shop problems incorporating multi-purpose machines, since one-machine relaxations do not allow for lower bounds.

Author: Brucker, Peter, Jurisch, Bernd
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993

User Contributions:

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

CAPTCHA


The job shop scheduling problem: conventional and new solution techniques

Article Abstract:

The techniques for the job shop scheduling problem include special purpose heuristics, problem decomposition, constraints and propagation of variables' domain modification, neighborhood structures and local search methods. A job shop consists of a set of different machines that perform operations on jobs. The problem is to find the job sequences on the machines which minimize the completion time of all operations.

Author: Domschke, Wolfgang, Blazewicz, Jacek, Pesch, Erwin
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Research, Shop mathematics

User Contributions:

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

CAPTCHA


Subjects list: Scheduling (Management), Methods, Management, Machine shops
Similar abstracts:
  • Abstracts: The course scheduling problem at Lufthansa technical training. An iterative scheduling technique for resource-constrained project scheduling
  • Abstracts: Cross-straits trafficking: China implicated in record heroin seizure. Chafing at the bit: Taiwanese firms discuss warnings about China
  • Abstracts: Cash flow optimization in delivery scheduling. Efficient scheduling of periodic information monitoring requests
  • Abstracts: The consequences for manufacturers of changes in retail distribution. Developments in implementable retailing research
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.