A tabu-search algorithm for two-machine flow-shop with controllable processing times

Author

Kailiang Xu ; Gang Zheng ; Sha Liu

Author_Institution

Sch. of Autom. & Inf. Eng., Xi´an Univ. of Technol., Xi´an, China

fYear

2014

fDate

9-12 Dec. 2014

Firstpage

60

Lastpage

66

Abstract

This paper concerns on a two-machine flow-shop scheduling problem with controllable processing times modeled by a non-linear convex resource consumption function. The objective is to minimize the resource consumption that is needed to control the makespan not to exceed the given deadline. A tabu-search algorithm is designed, which searches for the optimal or near optimal job-processing sequence, while the processing times of the operations are determined by an optimal resource allocation algorithm thereafter. Numerical experiment shows the tabu-search algorithm is able to provide optimal or near-optimal solutions for medium or large-scaled problems.

Keywords

convex programming; flow shop scheduling; minimisation; resource allocation; search problems; controllable processing times; makespan control; near optimal job-processing sequence; nonlinear convex resource consumption function; optimal job-processing sequence; optimal resource allocation algorithm; resource consumption minimization; tabu-search algorithm; two-machine flow-shop scheduling problem; Educational institutions; Heuristic algorithms; Job shop scheduling; Resource management; Schedules; Single machine scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence for Engineering Solutions (CIES), 2014 IEEE Symposium on

Conference_Location

Orlando, FL

Type

conf

DOI

10.1109/CIES.2014.7011832

Filename

7011832