Scheduling parallel CNC machines with time/cost trade-off considerations

DOI10.1016/J.COR.2005.10.018MaRDI QIDQ875425zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

parallel machine schedulingtotal completion timecontrollable processing timesCNC machinesmanufacturing cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
• Minimizing makespan subject to minimum flowtime on two identical parallel machines
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Multicriteria scheduling
• Parallel machine scheduling with a convex resource consumption function
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Rescheduling of identical parallel machines under machine eligibility constraints.
• Some NP-complete problems in quadratic and nonlinear programming
• Two parallel machine sequencing problems involving controllable job processing times

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

Describes a project that uses

Uses Software

• GAMS

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)