Bertrand M. T. Lin
According to our database^{1},
Bertrand M. T. Lin
authored at least 66 papers
between 1992 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2021
Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing.
Comput. Ind. Eng., 2021
2020
J. Sched., 2020
Electron. Libr., 2020
Comput. Ind. Eng., 2020
A Decision Model for Human Resource Allocation in Project Management of Software Development.
IEEE Access, 2020
2019
Minimizing machine assignment costs over Δapproximate solutions of the scheduling problem <i>P</i><i>C</i><sub>max</sub>.
Theor. Comput. Sci., 2019
Preemptive parallelmachine scheduling problem of maximizing the number of ontime jobs.
J. Sched., 2019
2018
Survey and extensions of manufacturing models in twostage flexible flow shops with dedicated machines.
Comput. Oper. Res., 2018
Comput. Ind. Eng., 2018
2017
Twomachine flowshop scheduling with threeoperation jobs subject to a fixed job sequence.
J. Sched., 2017
2016
J. Sched., 2016
J. Oper. Res. Soc., 2016
Comput. Oper. Res., 2016
Ann. Oper. Res., 2016
2015
Discret. Optim., 2015
Comput. Ind. Eng., 2015
2014
Fast approximation algorithms for bicriteria scheduling with machine assignment costs.
Eur. J. Oper. Res., 2014
Scheduling for fabrication and assembly in a twomachine flowshop with a fixed job sequence.
Ann. Oper. Res., 2014
2013
Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries.
Inf. Syst., 2013
Comput. Ind. Eng., 2013
Appl. Math. Comput., 2013
2012
Twostage assemblytype flowshop batch scheduling problem subject to a fixed job sequence.
J. Oper. Res. Soc., 2012
Total completion time minimization in twomachine flow shop scheduling problems with a fixed job sequence.
Discret. Optim., 2012
Resourceconstrained flowshop scheduling with separate resource recycling operations.
Comput. Oper. Res., 2012
Discrete particle swarm optimization for materials acquisition in multiunit libraries.
Proceedings of the IEEE Congress on Evolutionary Computation, 2012
2011
Theor. Comput. Sci., 2011
Total completion time minimization in a 2stage differentiation flowshop with fixed sequences per job type.
Inf. Process. Lett., 2011
Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion.
Eng. Appl. Artif. Intell., 2011
Comput. Ind. Eng., 2011
Efficient enumeration of optimal and approximate solutions of a scheduling problem.
Proceedings of the 10th CologneTwente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Multicriteria DecisionMaking, 2011
2010
J. Sched., 2010
Appl. Math. Comput., 2010
Proceedings of the 5th IEEE International Conference on Intelligent Systems, 2010
Discrete Particle Swarm Optimization for Materials Budget Allocation in Academic Libraries.
Proceedings of the 13th IEEE International Conference on Computational Science and Engineering, 2010
2009
Eur. J. Oper. Res., 2009
A twomachine flowshop problem with processing timedependent buffer constraints  An application in multimedia presentations.
Comput. Oper. Res., 2009
Scheduling of a twostage differentiation flowshop to minimize weighted sum of machine completion times.
Comput. Oper. Res., 2009
2008
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities.
J. Netw. Comput. Appl., 2008
2007
Complexity results for singlemachine scheduling with positional learning effects.
J. Oper. Res. Soc., 2007
J. Oper. Res. Soc., 2007
Eur. J. Oper. Res., 2007
2006
Int. Trans. Oper. Res., 2006
Int. J. Syst. Sci., 2006
Discret. Optim., 2006
Comput. Oper. Res., 2006
Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities.
Comput. Commun., 2006
Comput. Educ., 2006
2005
On the development of a computerassisted testing system with genetic test sheetgenerating approach.
IEEE Trans. Syst. Man Cybern. Part C, 2005
Minimizing the total completion time in singlemachine scheduling with stepdeteriorating jobs.
Comput. Oper. Res., 2005
A Simple Lower Bound for total Completion Time Minimization in a TwoMachine flowshop.
Asia Pac. J. Oper. Res., 2005
Ann. Oper. Res., 2005
2004
Makespan minimization in singlemachine scheduling with stepdeterioration of processing times.
J. Oper. Res. Soc., 2004
Eur. J. Oper. Res., 2004
Application of ant colony optimization for nowait flowshop scheduling problem to minimize the total completion time.
Comput. Ind. Eng., 2004
Ann. Oper. Res., 2004
2003
AntTree: an ant colony optimization approach to the generalized minimum spanning tree problem.
J. Exp. Theor. Artif. Intell., 2003
2002
Eur. J. Oper. Res., 2002
2001
On the variabledepthsearch heuristic for the linearcost generalized assignment problem.
Int. J. Comput. Math., 2001
Comput. Oper. Res., 2001
1999
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints.
Eur. J. Oper. Res., 1999
The strong NPhardness of twostage flowshop scheduling with a common secondstage machine.
Comput. Oper. Res., 1999
1997
SIAM J. Optim., 1997
J. Inf. Sci. Eng., 1997
Comput. Oper. Res., 1997
1992
ResourceRequirment Minimization in Relocation Problems with Precedence Constraints.
Proceedings of the Computing and Information, 1992