Scheduling parallel CNC machines with time/cost trade-off considerations
From MaRDI portal
Publication:875425
DOI10.1016/J.COR.2005.10.018zbMATH Open1141.90427OpenAlexW2150482375MaRDI QIDQ875425FDOQ875425
Authors: Sinan Gürel, M. Selim Aktürk 
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23385
Recommendations
- Considering manufacturing cost and scheduling performance on a CNC turning machine
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
- 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
parallel machine schedulingtotal completion timecontrollable processing timesCNC machinesmanufacturing cost
Cites Work
- Some NP-complete problems in quadratic and nonlinear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria scheduling
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Two parallel machine sequencing problems involving controllable job processing times
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Parallel machine scheduling with a convex resource consumption function
- Rescheduling of identical parallel machines under machine eligibility constraints.
Cited In (10)
- A survey on offline scheduling with rejection
- Single CNC machine scheduling with controllable processing times and multiple due dates
- A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Considering manufacturing cost and scheduling performance on a CNC turning machine
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Non-identical parallel CNC machine scheduling
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
Uses Software
This page was built for publication: Scheduling parallel CNC machines with time/cost trade-off considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875425)
