loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Nhat-Vinh Vo ; Pauline Fouillet and Christophe Lenté

Affiliation: Université François-Rabelais de Tours, France

ISBN: 978-989-758-017-8

Keyword(s): Scheduling, Flowshop, Total Completion Time, Lower Bound.

Related Ontology Subjects/Areas/Topics: Applications ; Operational Research ; Pattern Recognition ; Scheduling ; Software Engineering

Abstract: The flowshop scheduling problem has been largely studied for 60 years. As a criterion, the total completion time also receives a great amount of attention. Many studies have been carried out in the past but they are limited in the number of machines or constraints. MaxPlus algebra is also applied to the scheduling theory but the literature focuses on some concrete constraints. Therefore, this study presents a new method to tackle a general permutation flowshop problem, with additional constraints, to elaborate on lower bounds for the total completion time. These lower bounds can take into account several constraints, like delays, blocking or setup times, but they imply to solve a Traveling Salesman Problem. The theory is developed, based on a MaxPlus modeling of flowshop problems and experimental results are presented.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

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

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:
Vo N., Fouillet P. and Lenté C. (2014). General Lower Bounds for the Total Completion Time in a Flowshop Scheduling Problem - MaxPlus Approach.In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 382-389. DOI: 10.5220/0004833403820389

@conference{icores14,
author={Nhat-Vinh Vo and Pauline Fouillet and Christophe Lenté},
title={General Lower Bounds for the Total Completion Time in a Flowshop Scheduling Problem - MaxPlus Approach},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={382-389},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004833403820389},
isbn={978-989-758-017-8},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - General Lower Bounds for the Total Completion Time in a Flowshop Scheduling Problem - MaxPlus Approach
SN - 978-989-758-017-8
AU - Vo N.
AU - Fouillet P.
AU - Lenté C.
PY - 2014
SP - 382
EP - 389
DO - 10.5220/0004833403820389

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.