Lin Bertrand M.T.

Bertrand M.T. Lin

Information about the author Bertrand M.T. Lin will soon be added to the site.
Found 10 papers in total
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time
2004
Ant colony optimization (ACO) is a metaheuristic proposed to derive approximate...
Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs
2004
There is a set of jobs available to process in batches on a set of identical parallel...
Minimization of maximum lateness under linear deterioration
2003
This paper considers a single-machine scheduling problem to minimize the maximum...
An Ant Colony Optimization algorithm for the minimum weight vertex cover problem
2004
Given an undirected graph and a weighting function defined on the vertex set, the...
Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
2001
We consider a scheduling problem where a set of jobs are simultaneously available for...
Scheduling in the two-machine flowshop with due date constraints
2001
The problem of minimizing either the maximum tardiness or the number of tardy jobs in...
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
1999
The problem of interest is to schedule two types of jobs on a two-stage flowshop with...
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
1999
The relocation problem addressed in this paper is to determine a reconstruction...
Scheduling to minimize the total compression and late costs
1998
We consider a single-machine scheduling model in which the job processing times are...
Two-stage flowshop scheduling with a common second-stage machine
1997
This article considers minimizing the makespan in a two-stage flowshop scheduling...
Papers per page: