Considering manufacturing cost and scheduling performance on a CNC turning machine

DOI10.1016/J.EJOR.2005.11.029MaRDI QIDQ856225zbMATH OpenOpenAlexFDO

Authors Sinan Gürel, M. Selim Aktürk

Publication date 7 December 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/23532

zbMATH Keywords

schedulingtotal weighted completion timebicriteria optimizationcontrollable processing timescnc machinesmanufacturing cost

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• Scheduling parallel CNC machines with time/cost trade-off considerations
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Non-identical parallel CNC machine scheduling
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times

Cites work

• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• A survey of results for sequencing problems with controllable processing times
• An Interactive Multiple Criteria Approach for Parameter Selection in Metal Cutting
• Batch scheduling with controllable setup and processing times to minimize total completion time
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Effectiveness of a geometric programming algorithm for optimization of machining economics models
• Machine parameter selection for turning with constraints: an analytical approach based on geometric programming
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Multicriteria scheduling
• Performance of the MOSA method for the bicriteria assignment problem
• Positive half-products and scheduling with controllable processing times
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• Single machine scheduling with discretely controllable processing times
• Some NP-complete problems in quadratic and nonlinear programming
• Tool allocation and machining conditions optimization for CNC machines

Cited in

(11)

• Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns
• Single CNC machine scheduling with controllable processing times and multiple due dates
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Bicriteria robotic cell scheduling with controllable processing times
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Scheduling parallel CNC machines with time/cost trade-off considerations
• Non-identical parallel CNC machine scheduling
• A search method for optimal control of a flow shop system of traditional machines

Describes a project that uses

Uses Software

• GAMS

This page was built for publication: Considering manufacturing cost and scheduling performance on a CNC turning machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856225)