Yan Lan

Available identifiers

Publication	Date of Publication	Type
Flow shop scheduling problems with transportation constraints revisited	2024-01-08	Paper
Flow shop scheduling problems with transportation constraints revisited	2023-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q5875145	2023-02-09	Paper
A tight approximation algorithm for problem \(P2\rightarrow D\|v=1,c=1\|C_{\max }\)	2022-10-18	Paper
Open shop scheduling problem with a non-resumable flexible maintenance period	2022-06-29	Paper
A PTAS for non-resumable open shop scheduling with an availability constraint	2022-04-13	Paper
Approximation algorithms for two-stage flexible flow shop scheduling	2020-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q3132230	2018-01-29	Paper
Dynamic bin packing with unit fraction items revisited	2017-11-03	Paper
Flowshop problem \(F2 \to D\|v=1\), \(c\geq 1\|C_{\max}\) revisited	2017-03-16	Paper
Online bin packing problem with buffer and bounded size revisited	2017-02-22	Paper
Complexity of problem \(TF2\|v=1,c=2\|C_{\max}\)	2015-11-05	Paper
Online minimum makespan scheduling with a buffer	2014-11-14	Paper
2D knapsack: packing squares	2013-12-19	Paper
Online Minimum Makespan Scheduling with a Buffer	2012-07-16	Paper
Optimal algorithms for online scheduling with bounded rearrangement at the end	2012-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q5191385	2009-08-06	Paper
Change-point estimation under adaptive sampling	2009-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q3441512	2007-05-30	Paper

This page was built for person: Yan Lan