Abstracts - faqs.org

Abstracts

Engineering and manufacturing industries

Search abstracts:
Abstracts » Engineering and manufacturing industries

Batching policies for linearly increasing demand with a finite input rate

Article Abstract:

A modified version of the methodology used for dealing with batching methods aimed at increasing demand procedures is utilized to account for instances characterized by a finite production rate. The proposed method is not complicated and merely requires simple direct computations using numerical analysis to come up with its results. Its advantage over methods for infinite input rates, which are incidentally simpler, is greatest when the input rate is similar to the demand rate.

Author: Hill, Roger M.
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1996

User Contributions:

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

CAPTCHA


Due-date assignment and single machine scheduling with compressible processing times

Article Abstract:

Two models are derived to deal with the problem of determining optimal due-date assignment and scheduling goals within the context of compressible processing times. The models likewise aim to minimize penalties for job completion done earlier than scheduled and lateness. One model uses the common due-date assignment technique while the other uses the slack due-date assignment method. The appropriate algorithm for the solution of the problem is presented.

Author: Cheng, T.C.E., Oguz, C., Qi, X.D.
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1996

User Contributions:

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

CAPTCHA


A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times

Article Abstract:

The use of a three-stage heuristic method to cope with the problem of scheduling a fixed number of jobs to parallel machines which have the same properties results in the shortening of execution time. This method performs better than current solutions such as those derived from solutions pertinent to the Traveling Salesman Problem. A tabu search method is utilized in the ultimate phase of the heuristic.

Author: Laporte, Gilbert, Franca, Paulo M., Gendreau, Michel, Muller, Felipe M.
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1996

User Contributions:

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

CAPTCHA


Subjects list: Research, Scheduling (Management), Production management
Similar abstracts:
  • Abstracts: Funding soars for weaponry in US budget. Troubled weather satellite program. U.S. climate technology plan
  • Abstracts: Get involved early in design. Rinnai
  • Abstracts: Learning where the jobs are. Dealing with the media. Making committees work
  • Abstracts: Relaying QFD messages around the world. On-line quality courses offer many side benefits. List relays large quantity of QUALITY messages
  • Abstracts: Graphical methods and principles for data analysis II: Austria first? Zambia last? Examples and enhancements
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.