Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Tool allocation and machining conditions optimization for CNC machines

Article Abstract:

The problem of simultaneously making tool allocation and machining decisions under tool wear, tool availability, and tool replacing and loading time constraints was considered. Specifically, a new heuristic for the multiple operation case was developed based on an extension to the single machine operation problem. The heuristic, which may be refined to yield an exact solution, incorporates a cost measure to evaluate trade-offs between any conflicting decisions.

Author: Akturk, M. Selim, Avci, Selcuk
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Research, Case studies, Technology application, Resource allocation, Machining

User Contributions:

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

CAPTCHA


Match-up scheduling under a machine breakdown

Article Abstract:

Machine shop disruptions create new conditions that may make a preplanned schedule useless. Thus, rescheduling options that integrate such dynamic possibilities must be prepared. Such a technique is shown to be effective for the reactive hierarchical scheduling approach (RHSA) where a modified flow shop structure is adapted for machine breakdowns using match-up scheduling. Schedule quality and stability are increased and less deviation is observed for RHSA.

Author: Akturk, M. Selim, Gorgulu, Elif
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
Models

User Contributions:

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

CAPTCHA


Scheduling with tool changes to minimize total completion time: basic results and SPT performance

Article Abstract:

A single machine sequencing problem subject to tool wear is considered in a study, where the objective is to minimize the total completion time. The main focus is on the performance of the shortest processing time (SPT) list-scheduling heuristic, with theoretical worst-case bounds on SPT performance and a demonstration of its empirical behavior.

Author: Ghosh, Jay B., Akturk, M. Selim, Gunes, Evrim D.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
United States

User Contributions:

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

CAPTCHA


Subjects list: Operations research, Management science, Scheduling (Management)
Similar abstracts:
  • Abstracts: Emerging market conditions and their impact on first mover advantages. Designing global new product teams; optimizing the effects of national culture on new product development
  • Abstracts: Modelling and optimisation for sustainable development policy assessment. On the distribution of calls in an wireless network driven by fluid traffic
  • Abstracts: Comparison of iterative improvement techniques for schedule optimization. Local search for shift design
  • Abstracts: The space of freedom of the decision maker: modelling the human brain. The management of the future ethics in OR: respect, multicriteria management, and happiness
  • Abstracts: Soul-satisfying soups. Soups that are a meal. Outsmart the sick season ... with red bell peppers
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.