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

DOI10.1016/j.cor.2005.10.018zbMath1141.90427OpenAlexW2150482375MaRDI QIDQ875425

Sinan Gürel, M. Selim Akturk

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 schedulingCNC machinestotal completion timecontrollable processing timesmanufacturing cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ A survey on offline scheduling with rejection ⋮ A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Uses Software

• GAMS

Cites Work

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

This page was built for publication: Scheduling parallel CNC machines with time/cost trade-off considerations