Considering manufacturing cost and scheduling performance on a CNC turning machine
type: Item
instance of: scholarly article
title: Considering manufacturing cost and scheduling performance on a CNC turning machine
zbMATH Open document ID: 1102.90322
author: Sinan Gürel
author: M. Selim Aktürk
published in: European Journal of Operational Research
publication date: 2006-12-07T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/23532
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5078482
zbMATH Keywords: scheduling
zbMATH Keywords: bicriteria optimization
zbMATH Keywords: controllable processing times
zbMATH Keywords: cnc machines
zbMATH Keywords: manufacturing cost
zbMATH Keywords: total weighted completion time
describes a project that uses: GAMS
MaRDI profile type: Publication
OpenAlex ID: W2153777207
cites work: Tool allocation and machining conditions optimization for CNC machines
cites work: Single machine scheduling with discretely controllable processing times
cites work: Effectiveness of a geometric programming algorithm for optimization of machining economics models
cites work: Batch scheduling with controllable setup and processing times to minimize total completion time
cites work: Machine parameter selection for turning with constraints: an analytical approach based on geometric programming
cites work: Multicriteria scheduling
cites work: Positive half-products and scheduling with controllable processing times
cites work: A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
cites work: An Interactive Multiple Criteria Approach for Parameter Selection in Metal Cutting
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: A survey of results for sequencing problems with controllable processing times
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: Performance of the MOSA method for the bicriteria assignment problem
cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
cites work: Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
DOI: 10.1016/J.EJOR.2005.11.029
description: scientific article; zbMATH DE number 5078482