[Scheduling seminar] Debiao Li (Fuzhou University) | May 13 | Feature-driven Robust Stochastic Scheduling for Printed Circuit Board Assembly

Zdenek Hanzalek via dmanet <[email protected]> Mon, 11 May 2026 10:01:26 +0200
Newsgroups gmane.science.mathematics.discrete
Message-ID <[email protected]>
Dear scheduling researcher,

We are delighted to announce the talk given by Debiao Li (Fuzhou 
University). The title is "Feature-driven Robust Stochastic Scheduling 
for Printed Circuit Board Assembly". The seminar will take place on Zoom 
on Wednesday, May 13 at 13:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/94170422099?pwd=XOpJ7g8jqnVkVSE7fdvdoBKFlpmjZE.1
Meeting ID: 941 7042 2099
Passcode: 003670

You can follow the seminar online or offline on our Youtube channel as 
well:
https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.
Motivated by an industry project, this talk addresses scheduling in 
printed circuit board assembly (PCBA), a bottleneck of electronic 
manufacturing. We consider uncertain processing and setup times arising 
from machine variability and human intervention and model the problem as 
identical parallel machine scheduling to minimize total completion time 
and makespan. We develop a feature-driven robust stochastic optimization 
model that embeds production features into decision-making: processing 
times are predicted via support vector regression, while setup 
uncertainty is captured through event-wise ambiguity sets constructed by 
K-means clustering. The model is reformulated as a mixed-integer linear 
program and solved using a branch-and-price (B&P) algorithm. Experiments 
on real-world data show that the proposed approach outperforms sample 
average approximation (SAA) and standard distributionally robust 
optimization (DRO) by 52% and 33%, respectively. The B&P algorithm 
scales well to realistic instances, and sensitivity analysis reveals the 
impact of setup scenarios on the trade-off between solution quality and 
computational effort.

The next talk in our series will be
Danny Segev (Tel Aviv University) | June 10 | New Approximation 
Guarantees for The Inventory Staggering Problem.
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
*
*                   [email protected]
*
*   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/
*
**********************************************************