Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search

Kailiang Xu, Gang Zheng

2015

Abstract

A two-machine flow-shop scheduling problem with controllable processing times modeled by a non-linear convex resource consumption function is considered in this paper. The objective is to minimize the resource consumption that is needed to control the makespan not to exceed the given deadline. The problem is proved to be strongly NP-hard. An optimal resource allocation algorithm is designed to calculate the optimal processing times of the jobs, while the optimal or near-optimal processing sequence of the jobs is determined by a heuristic or a tabu-search algorithm.

Paper Citation

in Harvard Style

Xu K. and Zheng G. (2015). Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 14-22. DOI: 10.5220/0005204300140022

in Bibtex Style

@conference{icores15,
author={Kailiang Xu and Gang Zheng},
title={Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={14-22},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005204300140022},
isbn={978-989-758-075-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Schedule Two-machine Flow-shop with Controllable Processing Times Using Tabu-search
SN - 978-989-758-075-8
AU - Xu K.
AU - Zheng G.
PY - 2015
SP - 14
EP - 22
DO - 10.5220/0005204300140022