Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness

Authors:
M. Selim Akturk;Taylan Ilhan
Affiliations:
Department of Industrial Engineering, Bilkent University, Ankara, Turkey;Department of Industrial Engineering, Bilkent University, Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2011

Citing 8
Cited 1

New search spaces for sequencing problems with application to job shop scheduling

Management Science
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

Journal of Scheduling
Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems

International Journal of Intelligent Systems Technologies and Applications
A population-based variable neighborhood search for the single machine total weighted tardiness problem

Computers and Operations Research
Minimizing total tardiness on a single machine with controllable processing times

Computers and Operations Research
A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates

Computers and Operations Research

Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Advanced manufacturing technologies, such as CNC machines, require significant investments, but also offer new capabilities to the manufacturers. One of the important capabilities of a CNC machine is the controllable processing times. By using this capability, the due date requirements of customers can be satisfied much more effectively. Processing times of the jobs on a CNC machine can be easily controlled via machining conditions such that they can be increased or decreased at the expense of tooling cost. Since scheduling decisions are very sensitive to the processing times, we solve the process planning and scheduling problems simultaneously. In this study, we consider the problem of scheduling a set of jobs on a single CNC machine to minimize the sum of total weighted tardiness, tooling and machining costs. We formulated the joint problem, which is NP-hard since the total weighted tardiness problem (with fixed processing times) is strongly NP-hard alone, as a nonlinear mixed integer program. We proposed a DP-based heuristic to solve the problem for a given sequence and designed a local search algorithm that uses it as a base heuristic.