Abstracts - faqs.org

Abstracts

Engineering and manufacturing industries

Search abstracts:
Abstracts » Engineering and manufacturing industries

Makespan comparison between resequencing and switching in a dynamic manufacturing environment

Article Abstract:

Previous research has proposed the adoption of a new scheduling approach that adopts the best from the sequencing and dispatching approaches by switching, depending on the manufacturing status, from fixed sequencing to dispatching. However, in the face of frequent resequencing, the new approach can still be improved by letting it take into account resequencing. The problem of selection between resequencing and switching as a scheduling approach in a job shop setting is studied.

Author: Matsuura, Haruki, Kanezashi, Masakazu
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


Cyclic scheduling for re-entrant manufacturing systems

Article Abstract:

A cyclic scheduling approach for re-entrant production systems, where the process route of a job passes manufacturing facilities at least once, is described. The proposed scheduling algorithm aims to maximize the production rate and minimize the throughput time. The production rate is maximized by determining the lot size while the throughput time is minimized by implementing a sequencing method of the lots.

Author: Yura, Kenji
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1999
Electronic computers, Electronic Computer Manufacturing, Flexible Manufacturing Systems

User Contributions:

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

CAPTCHA


A quick optimal algorithm for sequencing on one machine to minimize total tardiness

Article Abstract:

A quick optimal algorithm is proposed for sequentially ordering jobs for processing on a single machine to minimize total tardiness. The model is based on the branch and bound approach applied directly to Lawler's decomposition theorem to yield an optimal solution. Numerical results show that the proposed algorithm is suitable in dynamic scheduling environments where rescheduling is frequently required.

Author: Hirakawa, Yasuhiro
Publisher: Elsevier Science Publishers
Publication Name: International Journal of Production Economics
Subject: Engineering and manufacturing industries
ISSN: 0925-5273
Year: 1999
Usage, Branch and bound algorithms, Sequential machine theory

User Contributions:

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

CAPTCHA


Subjects list: Models, Scheduling (Management), Production management, Manufacturing industries, Manufacturing processes, Manufacturing
Similar abstracts:
  • Abstracts: A changing nation. Turning a concept into a manufacturable product. Twisted fins improve heat exchanger design
  • Abstracts: Speed and efficiency - a statistical enquiry of manufacturing industries. The practice of production control techniques in the manufacturing sectors in the Eastern Province of Saudi Arabia
  • Abstracts: A semi-open decomposition approach for an open queueing network in a general configuration with a kanban blocking mechanism
  • Abstracts: Agility, adaptability and leanness: a comparison of concepts and a study of practice. On a two-stage hierarchical production planning system for process industries
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.