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

Kailiang Xu; Gang Zheng

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

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

Topics: Dynamic Programming; Optimization

In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, 14-22, 2015 , Lisbon, Portugal

Authors: Kailiang Xu and Gang Zheng

Affiliation: Xi'an University of Technology, China

ISBN: 978-989-758-075-8

ISSN: 2184-4372

Keyword(s): Two-machine flow-shop, Controllable processing times, Heuristic, Tabu-search.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Dynamic Programming ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Methodologies and Technologies ; Operational Research ; Optimization ; Symbolic Systems

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 54.85.57.0

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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, ISSN 2184-4372, pages 14-22. DOI: 10.5220/0005204300140022

@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},
}

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