Abstracts - faqs.org

Abstracts

Engineering and manufacturing industries

Search abstracts:
Abstracts » Engineering and manufacturing industries

An experimental evaluation of heuristics for scheduling in a real-life flowshop with sequence-dependent setup times of jobs

Article Abstract:

A heuristic algorithm based on simulated annealing technique has been developed for the analysis of scheduling patterns in real-life flowshops. By assuming that the setup times of jobs are sequence-dependent and are distinct from process times, the proposed algorithm was used to minimize overall job tardiness in a drill bit manufacturing company. Further, the algorithm outlines a random insertion perturbation scheme for determining the maximum weighted tardiness of the job. It was also determined that the proposed heuristic is an effective method in addressing superior-quality related problems.

Author: Rajendran, Chandrasekharan, Parthasarathy, Srinivasaraghavan
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1997
Oil and gas field machinery, Oil and Gas Field Machinery and Equipment Manufacturing, Oilwell Bits, Case studies, Evaluation, Heuristic, Simulated annealing (Mathematics), Heuristics (Psychology), Oil well drilling equipment, Bits (Drilling and boring), Bits (Tools)

User Contributions:

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

CAPTCHA


Heuristic algorithm for scheduling in a flowshop to minimize total flowtime

Article Abstract:

A study was conducted to examine the development of a heuristic algorithm for flowshop scheduling. The study considers a heuristic programming approach which could possibly reduce total job flowtime. A preference relation is then established for job insertion in creating a complete job schedule. Results show that heuristic programming provides an optimal alternative for managing total flowtime and reducing scheduling costs.

Author: Rajendran, Chandrasekharan
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1993
Usage, Heuristic programming

User Contributions:

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

CAPTCHA


Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan

Article Abstract:

The flowshop scheduling problem has been traditionally solved using branch-and-bound algorithms, which assume that a single processor exists for every flowshop stage. However, practicality dictates that parallel processors be set up at certain stages. A branch-and-bound algorithm was developed to allow an optimal permutation schedule to keep makespan levels at a minimum in multi-stage flowshops having parallel processors.

Author: Rajendran, Chandrasekharan, Chaudhuri, Dipak
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1992
Algorithms, Parallel processing

User Contributions:

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

CAPTCHA


Subjects list: Models, Analysis, Scheduling (Management), Research
Similar abstracts:
  • Abstracts: An integrated inventory model for a single vendor and multiple buyers with ordering cost reduction. An inventory control model using fuzzy logic
  • Abstracts: Revolution or evolution? Modeling reality. Perspectives on visualization
  • Abstracts: An EOQ model for deteriorating items with a linear trend in demand and shortages in all cycles. Variations of order-level inventory models for deteriorating items
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.