We are delighted to announce the talk given by Laurent Houssin (ENAC,
Université de Toulouse). The title is "Flow-shop and job-shop robust
scheduling problems with budgeted uncertainty". The seminar will take
place on Zoom on Wednesday, December 10 at 14:00 UTC.
Join Zoom Meeting
https://cesnet.zoom.us/j/96120750687?pwd=mlAd3lUX8ZBccOYIIzHASMMHaYOkF3.1
Meeting ID: 961 2075 0687
Passcode: 793270
You can follow the seminar online or offline on our Youtube channel as
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A
The abstract follows.
We study different solution methods for two two-stage robust,
multi-machine scheduling problems under uncertainty budget. Compact
formulations of the problems are proposed and two decomposition
approaches are presented: a logic Benders decomposition approach and a
column and constraint generation approach. Computational experiments
show that for small-sized instances, a compact formulation of the
problem quickly yields optimal solutions. However, for larger instances,
decomposition methods, particularly the column and constraint generation
method with a master problem solved using constraint programming,
provide better quality solutions. An acceleration method for the column
and constraint generation algorithm is proposed. This method is generic
and can be applied to any two-stage robust optimisation problem.
The next talk in our series will be in January 2026.
For more details, please visit https://schedulingseminar.com/
With kind regards
Zdenek Hanzalek, Michael Pinedo and Guohua Wan
--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/
**********************************************************
*
* 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/
*
**********************************************************