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.
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
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.
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1993
User Contributions:
Comment about this article or add new information about this topic:
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.
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
- 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