Tuesday, February 1, 2011

[DMANET] BOOK ANNOUNCEMENT: Metaheuristics and Heuristics for heavily constrained hybrid Flowshop Problems

Metaheuristics and Heuristics for heavily constrained hybrid Flowshop
Problems

By Thijs Urlings

January 2011, 348 pages

Series: Dissertations in Artificial Intelligence (DISKI)

Volume: 331

ISBN 978-3-89838-331-8 (Akademische Verlagsgesellschaft AKA GmbH)

ISBN 978-1-60750-678-2 (IOS Press)

Description:

Many researchers agree about the existence of a gap between machine
scheduling literature on the one hand and scheduling in real-world
production environments on the other hand. This book aims to contribute
in diminishing this gap.
A hybrid flowshop problem with a combination of many constraints that
occur in reality, is addressed. An exact solution method is developed,
and some heuristics. Also, a number of metaheuristics is adapted to the
problem and several new ones are presented. Comparison is done,
enhancing statistical analyses. The solution representation appears to
have an important influence on the quality of the results.
Multiobjective scheduling is a common need in practice. For Pareto
optimisation in a hybrid flowshop, two algorithms and a complete
methodology for the comparison of approximation algorithms are
presented. From the obtained results, one can conclude that methods that
work well for relatively simple, theoretical problems do often not
behave so well for more complex real-life environments. Therefore,
research to this latter kind of problems is highly relevant.

For ordering details see the AKA website:

http://www.aka-verlag.com/loadtop/load.php?isbn=9783898383318

Dr. Thijs Urlings

Assistant Professor

Delft University of Technology

Innovation and Public Sector Efficiency Studies

T: +31 15 27 85538

F: +31 15 27 86332

E: t.h.urlings@tudelft.nl <mailto:t.h.urlings@tudelft.nl>

W: www.tudelft.nl/thurlings
<http://www.tbm.tudelft.nl/live/pagina.jsp?id=f9026b8d-01de-45ef-ace0-07
2fd644e447&lang=en
>


------_=_NextPart_001_01CBC1ED.DE842EFB
Content-Type: text/html;
charset="us-ascii"
Content-Transfer-Encoding: quoted-printable

<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 14 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";
mso-fareast-language:EN-US;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Calibri","sans-serif";
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;
font-family:"Calibri","sans-serif";
mso-fareast-language:EN-US;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:70.85pt 70.85pt 70.85pt 70.85pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=NL link=blue vlink=purple><div class=WordSection1><p class=MsoNormal><span lang=EN-GB>Metaheuristics and Heuristics for heavily constrained hybrid Flowshop Problems<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB>By Thijs Urlings<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB><o:p>&nbsp;</o:p></span></p><p class=MsoNormal><span lang=EN-GB>January 2011, 348 pages<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB>Series: Dissertations in Artificial Intelligence (DISKI)<o:p></o:p></span></p><p class=MsoNormal>Volume: 331<o:p></o:p></p><p class=MsoNormal><o:p>&nbsp;</o:p></p><p class=MsoNormal>ISBN 978-3-89838-331-8 (Akademische Verlagsgesellschaft AKA GmbH)<o:p></o:p></p><p class=MsoNormal><span lang=EN-GB>ISBN 978-1-60750-678-2 (IOS Press)<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB><o:p>&nbsp;</o:p></span></p><p class=MsoNormal><span lang=EN-GB>Description:<o:p></o:p></span></p><p class!
=MsoNormal><span lang=EN-GB>Many researchers agree about the existence of a gap between machine scheduling literature on the one hand and scheduling in real-world production environments on the other hand. This book aims to contribute in diminishing this gap.<br>A hybrid flowshop problem with a combination of many constraints that occur in reality, is addressed. An exact solution method is developed, and some heuristics. Also, a number of metaheuristics is adapted to the problem and several new ones are presented. Comparison is done, enhancing statistical analyses. The solution representation appears to have an important influence on the quality of the results.<br>Multiobjective scheduling is a common need in practice. For Pareto optimisation in a hybrid flowshop, two algorithms and a complete methodology for the comparison of approximation algorithms are presented. From the obtained results, one can conclude that methods that work well for relatively simple, theoretical pr!
oblems do often not behave so well for more complex real-life environments. Therefore, research to this latter kind of problems is highly relevant.<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB><o:p>&nbsp;</o:p></span></p><p class=MsoNormal><span lang=EN-GB>For ordering details see the AKA website:<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB><a href="http://www.aka-verlag.com/loadtop/load.php?isbn=9783898383318">http://www.aka-verlag.com/loadtop/load.php?isbn=9783898383318</a><o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB><o:p>&nbsp;</o:p></span></p><p class=MsoNormal><span lang=EN-GB><o:p>&nbsp;</o:p></span></p><p class=MsoNormal><span lang=EN-GB style='mso-fareast-language:NL'>Dr. Thijs Urlings<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='mso-fareast-language:NL'>Assistant Professor<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='mso-fareast-language:NL'><o:p>&nbsp;</o:p></span></p><p class=MsoNormal><span lang=EN-GB style='mso-fareast-language:NL'>Delft University of Tech!
nology<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-GB style='mso-fareast-language:NL'>Innovation and Public Sector Efficiency Studies<o:p></o:p></span></p><p class=MsoNormal><span lang=ES-AR style='mso-fareast-language:NL'>T: +31 15 27 85538<o:p></o:p></span></p><p class=MsoNormal><span lang=ES-AR style='mso-fareast-language:NL'>F: +31 15 27 86332<o:p></o:p></span></p><p class=MsoNormal><span lang=ES-AR style='mso-fareast-language:NL'>E: </span><a href="mailto:t.h.urlings@tudelft.nl"><span lang=ES-AR style='mso-fareast-language:NL'>t.h.urlings@tudelft.nl</span></a><span lang=ES-AR style='mso-fareast-language:NL'><o:p></o:p></span></p><p class=MsoNormal><span style='mso-fareast-language:NL'>W: </span><a href="http://www.tbm.tudelft.nl/live/pagina.jsp?id=f9026b8d-01de-45ef-ace0-072fd644e447&amp;lang=en"><span style='mso-fareast-language:NL'>www.tudelft.nl/thurlings</span></a><span style='mso-fareast-language:NL'><o:p></o:p></span></p></div></body></html>
------_=_NextPart_001_01CBC1ED.DE842EFB--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************