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

Authors:
Kailiang Xu;Zuren Feng;Keliang Jun
Affiliations:
State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an 710049, People's Republic of China;State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an 710049, People's Republic of China;State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an 710049, People's Republic of China
Venue:
Computers and Operations Research
Year:
2010

Citing 7
Cited 1

Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
A tabu search algorithm for parallel machine total tardiness problem

Computers and Operations Research
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Computers and Operations Research
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

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

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In many real-world production systems, it is important to schedule jobs such that they could be processed and shipped with no delay. In this paper, we consider the problem of scheduling n jobs with arbitrary release dates and due dates on a single machine, where job-processing times can be controlled by the allocation of a common resource, and the operation is modeled by a non-linear convex resource consumption function. The objective is to obtain an optimal processing permutation as well as an optimal resource allocation, such that all the jobs can be finished no later than their due dates, and the total resource consumption can be minimized. The problem is strongly NP- hard. A two-layer-structured algorithm based on the tabu-search is presented. The computational result, compared with that from a branch and bound algorithm, shows the algorithm is capable of producing optimal or near optimal solution for large-sized problems in an acceptable computational time.