Optimal allocation and processing time decisions on non-identical parallel CNC machines: -constraint approach

DOI10.1016/J.EJOR.2006.10.024MaRDI QIDQ2371348zbMATH OpenOpenAlexFDO

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

Publication date 4 July 2007

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

Full work available at URL https://doi.org/10.1016/j.ejor.2006.10.024

zbMATH Keywords

makespanmanufacturing cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling parallel CNC machines with time/cost trade-off considerations
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• Non-identical parallel CNC machine scheduling
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Two-machine flowshop scheduling with flexible operations and controllable processing times

Cites work

• A bicriterion approach to time/cost trade-offs in sequencing
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
• Algorithms for Scheduling Tasks on Unrelated Processors
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Convergence of the (GOP) algorithm for a large class of smooth optimization problems
• Heuristics for determining economic processing rates in a flexible manufacturing system
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Notes on max flow time minimization with controllable processing times
• Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Scheduling Multiple Variable-Speed Machines
• Some comments on sequencing with controllable processing times

Cited in

(9)

• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• An anticipative scheduling approach with controllable processing times
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• A multi-stage stochastic programming approach in master production scheduling
• Non-identical parallel CNC machine scheduling
• Considering manufacturing cost and scheduling performance on a CNC turning machine
• Scheduling parallel CNC machines with time/cost trade-off considerations
• Parallel machine match-up scheduling with manufacturing cost considerations

This page was built for publication: Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach

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