Tabu-search for single machine scheduling with controllable processing times

Authors:
Zuren Feng;Kailiang Xu
Affiliations:
Xi'an Jiaotong University, Xi'an, China;Xi'an Jiaotong University, Xi'an, China
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 5
Cited 0

Tabu Search

Tabu Search
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Computers and Operations Research
Convex resource allocation for minimizing the makespan in a single machine with job release dates

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider scheduling n jobs with arbitrary release dates and due dates on a single machine, where jobs' 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 sequence as well as optimal resource allocation, such that all the jobs could be finished no later than their due dates, and the resource consumption could be minimized. Since the problem is strongly NP-hard, a two-layer-structured algorithm based on tabu-search is presented. The computational result compared with a branch-and-bound algorithm showed the algorithm is capable for producing optimal and near optimal solution for large sized problems in acceptable computational time.