Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

Satisfying due dates in large job shops

Article Abstract:

Large job shop networks are faced with the difficult task of sequencing jobs, which is considered an NP-hard problem. A simulation-based approach to scheduling, which was based on the procedure discussed by Lawrence and Morton (1986), was developed to solve this problem. This analysis showed that this procedure offers optimal or near optimal schedules for the N-job, M-machine, maximum lateness problem, under certain conditions. The case that compelled this study involved a final assembly operation in a separate area of the company. There would be delays in the production schedules in this operation if maximum lateness is greater than zero. This investigation aimed to help the final assembly operation meet every due date, which was solved by reducing the maximum lateness. An effective lower bound computation for maximum lateness was formulated and an iterative scheduling procedure was developed.

Author: Hodgson, Thom J., Cormier, Denis, Weintraub, Alexander J., Zozom, Andrew, Jr.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
Analysis, Machinery, Calendar, Machine shops

User Contributions:

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

CAPTCHA


Economic lot scheduling for multiple products on parallel identical processors

Article Abstract:

A heuristic process is suggested to address an identical, multiproduct, multiprocessor, lot-scheduling problem. The focus of the analysis is to reduce the average inventory and production costs per unit time subject to limits of no inference and no shortages among products. A mathematical formulation for the problem is developed, and computational results are reported after applying the heuristic process. Research results indicate that the heuristic process decomposes the entire problem into lot-size scheduling and allocation parts and improves one while holding the other part constant. Results also suggest that the process gave solutions with deviations of less than five percent of the lower bound for up to 10 processors and 100 products.

Author: Carreno, Jose Juan
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1990
Research, Inventory control, Production control

User Contributions:

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

CAPTCHA



Subjects list: Scheduling (Management)
Similar abstracts:
  • Abstracts: Relationship of career mentoring and socioeconomic origin to managers' and professionals' early career progress
  • Abstracts: Organizational dress as a symbol of multilayered social identities. When cashiers meet customers: an analysis of the role of supermarket cashiers
  • Abstracts: Responding to the challenge of HDTV. Managing trade by rules and outcomes. Old economic logic in the new economy
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.