Scheduling with tool changes to minimize total completion time under controllable machining conditions

Authors:
M. Selim Akturk;Jay B. Ghosh;Rabia K. Kayan
Affiliations:
Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Information and Operations Management, University of Southern California, USA;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2007

Citing 9
Cited 1

Models arising from a flexible manufacturing machine, Part I: minimization of the number of tool switches

Operations Research
Single machine flow-time scheduling with a single breakdown

Acta Informatica
Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
A synthesis of decision models for tool management in automated manufacturing

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

Management Science
Machining condition optimization by genetic algorithms and simulated annealing

Computers and Operations Research
Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research
Approximation schemes for parallel machine scheduling problems with controllable processing times

Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research

Optimization of multi-task turning operations under minimal tool waste consideration

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention. Though machining conditions impact tool wear and induce tool change, the two issues have not been considered together. We address for the first time the problem of scheduling a computer numerically controlled (CNC) machine subject to tool changes and controllable machining conditions; our objective is to minimize the total completion time of a given set of jobs. We establish an important result that helps us identify feasible settings of machining parameters such as feed rate and cutting speed. However, the problem at hand remains intractable, even when a single setting is used. In the general case, we are able to solve the problem exactly for up to 30 jobs using a mixed integer linear programming formulation. For larger problems, we turn to approximate solution via heuristics. We examine a number of different schemes. The best of these schemes are used in a problem space genetic algorithm; this produces quality solutions in a time-efficient manner, as is evidenced from an extensive computational study conducted by us.