Bertrand M. T. Lin

According to our database1, Bertrand M. T. Lin authored at least 66 papers between 1992 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Text mining approach for bottleneck detection and analysis in printed circuit board manufacturing.
Comput. Ind. Eng., 2021

Editorial: Dynamic Scheduling Problems.
J. Sched., 2020

Forming a TED talks sphere for convenient search.
Electron. Libr., 2020

Scheduling step-deteriorating jobs to minimize the total completion time.
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

Parallel dedicated machine scheduling with conflict graphs.
Comput. Ind. Eng., 2018

Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence.
J. Sched., 2017

Relocation scheduling subject to fixed processing sequences.
J. Sched., 2016

Two-stage flexible flow shop scheduling subject to fixed job sequences.
J. Oper. Res. Soc., 2016

Acquisition planning and scheduling of computing resources.
Comput. Oper. Res., 2016

Flow shop non-idle scheduling and resource-constrained scheduling.
Ann. Oper. Res., 2016

Single-machine scheduling with supporting tasks.
Discret. Optim., 2015

Resource-constrained scheduling with optional recycling operations.
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

Parallel-machine scheduling to minimize tardiness penalty and power cost.
Comput. Ind. Eng., 2013

Sequence-dependent scheduling with order deliveries.
Appl. Math. Comput., 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

Tight complexity analysis of the relocation problem with arbitrary release dates.
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

Coupled-task scheduling on a single machine subject to a fixed-job-sequence.
Comput. Ind. Eng., 2011

Efficient enumeration of optimal and approximate solutions of a scheduling problem.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Applying DPSO with dynamic diversity to books selection problem.
Proceedings of the 2011 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making, 2011

Minimizing the total weighted completion time in the relocation problem.
J. Sched., 2010

Scheduling time-dependent jobs under mixed deterioration.
Appl. Math. Comput., 2010

An evolutionary approach to library materials acquisition problems.
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

Johnson's rule, composite jobs and the relocation problem.
Eur. J. Oper. Res., 2009

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

Complexity results for single-machine scheduling with positional learning effects.
J. Oper. Res. Soc., 2007

A note on parallel-machine scheduling with deteriorating jobs.
J. Oper. Res. Soc., 2007

Customer order scheduling to minimize the number of late jobs.
Eur. J. Oper. Res., 2007

Two-machine flowshop scheduling with conditional deteriorating second operations.
Int. Trans. Oper. Res., 2006

On the relocation problem with a second working crew for resource recycling.
Int. J. Syst. Sci., 2006

On relocation problems with multiple identical working crews.
Discret. Optim., 2006

Ant colony optimization for the cell assignment problem in PCS networks.
Comput. Oper. Res., 2006

Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities.
Comput. Commun., 2006

An effective approach for test-sheet composition with large-scale item banks.
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

Two-Machine Flowshop Batching and Scheduling.
Ann. Oper. Res., 2005

Makespan minimization in single-machine scheduling with step-deterioration of processing times.
J. Oper. Res. Soc., 2004

A concise survey of scheduling with time-dependent processing times.
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

An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem.
Ann. Oper. Res., 2004

Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem.
J. Exp. Theor. Artif. Intell., 2003

Fabrication scheduling on a single machine with due date constraints.
Eur. J. Oper. Res., 2002

On the variable-depth-search heuristic for the linear-cost generalized assignment problem.
Int. J. Comput. Math., 2001

Batch scheduling in the no-wait two-machine flowshop to minimize the makespan.
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

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties.
SIAM J. Optim., 1997

Construction N Latin Squares for ???.
J. Inf. Sci. Eng., 1997

Two-stage flowshop scheduling with a common second-stage machine.
Comput. Oper. Res., 1997

Resource-Requirment Minimization in Relocation Problems with Precedence Constraints.
Proceedings of the Computing and Information, 1992