Bertrand M. T. Lin
According to our database1, Bertrand M. T. Lin authored at least 66 papers between 1992 and 2021.
Legend:Book In proceedings Article PhD thesis Other
Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing.
Comput. Ind. Eng., 2021
Comput. Ind. Eng., 2020
A Decision Model for Human Resource Allocation in Project Management of Software Development.
IEEE Access, 2020
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 parallel-machine scheduling problem of maximizing the number of on-time jobs.
J. Sched., 2019
Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines.
Comput. Oper. Res., 2018
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence.
J. Sched., 2017
J. Oper. Res. Soc., 2016
Ann. Oper. Res., 2016
Comput. Ind. Eng., 2015
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.
Eur. J. Oper. Res., 2014
Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence.
Ann. Oper. Res., 2014
Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries.
Inf. Syst., 2013
Comput. Ind. Eng., 2013
Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence.
J. Oper. Res. Soc., 2012
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence.
Discret. Optim., 2012
Resource-constrained flowshop scheduling with separate resource recycling operations.
Comput. Oper. Res., 2012
Discrete particle swarm optimization for materials acquisition in multi-unit libraries.
Proceedings of the IEEE Congress on Evolutionary Computation, 2012
Theor. Comput. Sci., 2011
Total completion time minimization in a 2-stage 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
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making, 2011
J. Sched., 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
A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations.
Comput. Oper. Res., 2009
Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times.
Comput. Oper. Res., 2009
Multicast routing and wavelength assignment with delay constraints in WDM networks with heterogeneous capabilities.
J. Netw. Comput. Appl., 2008
J. Oper. Res. Soc., 2007
J. Oper. Res. Soc., 2007
Eur. J. Oper. Res., 2007
Int. Trans. Oper. Res., 2006
Int. J. Syst. Sci., 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
On the development of a computer-assisted testing system with genetic test sheet-generating approach.
IEEE Trans. Syst. Man Cybern. Part C, 2005
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs.
Comput. Oper. Res., 2005
A Simple Lower Bound for total Completion Time Minimization in a Two-Machine flowshop.
Asia Pac. J. Oper. Res., 2005
Makespan minimization in single-machine scheduling with step-deterioration of processing times.
J. Oper. Res. Soc., 2004
Eur. J. Oper. Res., 2004
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time.
Comput. Ind. Eng., 2004
Ann. Oper. Res., 2004
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem.
J. Exp. Theor. Artif. Intell., 2003
Eur. J. Oper. Res., 2002
On the variable-depth-search heuristic for the linear-cost generalized assignment problem.
Int. J. Comput. Math., 2001
Comput. Oper. Res., 2001
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints.
Eur. J. Oper. Res., 1999
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine.
Comput. Oper. Res., 1999
SIAM J. Optim., 1997
Comput. Oper. Res., 1997
Resource-Requirment Minimization in Relocation Problems with Precedence Constraints.
Proceedings of the Computing and Information, 1992