Wen-Chiung Lee

According to our database1, Wen-Chiung Lee authored at least 59 papers between 2000 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
A three-agent scheduling problem for minimizing the flow time on two machines.
RAIRO Oper. Res., 2020

2018
An availability-based system with general repair via Bayesian aspect.
Math. Comput. Simul., 2018

Minimizing the Total Weighted Completion Time for Three Cooperating Agents.
Proceedings of the 7th International Congress on Advanced Applied Informatics, 2018

2017
A three-agent scheduling problem for minimizing the makespan on a single machine.
Comput. Ind. Eng., 2017

A Three-Agent Flow Shop Problem for Minimizing the Total Completion Time.
Proceedings of the 6th IIAI International Congress on Advanced Applied Informatics, 2017

2016
A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents.
Knowl. Based Syst., 2016

A lower bound for minimizing the total completion time of a three-agent scheduling problem.
Inf. Sci., 2016

Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects.
Discret. Optim., 2016

Resource consumption minimization with a constraint of maximum tardiness on parallel machines.
Comput. Ind. Eng., 2016

A Three-Agent Scheduling Problem for Minimizing the Total Tardiness on a Single Machine.
Proceedings of the 5th IIAI International Congress on Advanced Applied Informatics, 2016

2015
A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity.
J. Oper. Res. Soc., 2015

Algorithms for single-machine scheduling to minimize the total tardiness with learning effects and two competing agents.
Concurr. Eng. Res. Appl., 2015

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time.
Comput. Ind. Eng., 2015

2014
Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning.
Optim. Lett., 2014

Single-machine scheduling with accelerating deterioration effects.
Optim. Lett., 2014

Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects.
Inf. Sci., 2014

Optimization analysis of an unreliable multi-server queue with a controllable repair policy.
Comput. Oper. Res., 2014

A scheduling problem with three competing agents.
Comput. Oper. Res., 2014

Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions.
Comput. Ind. Eng., 2014

2013
Single-machine scheduling with two competing agents and learning consideration.
Inf. Sci., 2013

Minimizing resource consumption on uniform parallel machines with a bound on makespan.
Comput. Oper. Res., 2013

Two-agent singe-machine scheduling with release times to minimize the total weighted completion time.
Comput. Oper. Res., 2013

A single-machine bi-criterion scheduling problem with two agents.
Appl. Math. Comput., 2013

2012
Single-machine scheduling with logarithm deterioration.
Optim. Lett., 2012

Uniform parallel-machine scheduling to minimize makespan with position-based learning curves.
Comput. Ind. Eng., 2012

Genetic algorithms for a two-agent single-machine problem with release time.
Appl. Soft Comput., 2012

Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs.
Appl. Math. Comput., 2012

2011
Scheduling problems with general effects of deterioration and learning.
Inf. Sci., 2011

Scheduling with general position-based learning curves.
Inf. Sci., 2011

A two-machine flowshop problem with two agents.
Comput. Oper. Res., 2011

Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness.
Comput. Oper. Res., 2011

Some single-machine and flowshop scheduling problems with a non-linear deterioration function.
Comput. Math. Appl., 2011

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time.
Comput. Math. Appl., 2011

Two-agent scheduling with learning consideration.
Comput. Ind. Eng., 2011

Deteriorating job scheduling to minimize the number of late jobs with setup times.
Comput. Ind. Eng., 2011

A Single-Machine deteriorating Job Scheduling Problem with a Non-Regular Criterion.
Asia Pac. J. Oper. Res., 2011

2010
Erratum to 'Some single-machine and m-machine flowshop scheduling problems with learning considerations' [Inform. Sci. 179(2009) 3885-3892].
Inf. Sci., 2010

Single-machine scheduling with a nonlinear deterioration function.
Inf. Process. Lett., 2010

Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem.
Expert Syst. Appl., 2010

A note on optimal policies for two group scheduling problems with deteriorating setup and processing times.
Comput. Ind. Eng., 2010

Erratum to 'Single-machine and flowshop scheduling with a general learning effect model' [Computers & Industrial Engineering 56 (2009) 1553-1558].
Comput. Ind. Eng., 2010

Scheduling problems with deteriorating jobs and learning effects including proportional setup times.
Comput. Ind. Eng., 2010

2009
Some single-machine and m-machine flowshop scheduling problems with learning considerations.
Inf. Sci., 2009

Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations.
Inf. Sci., 2009

A single-machine bi-criterion learning scheduling problem with release times.
Expert Syst. Appl., 2009

A note on the total completion time problem in a permutation flowshop with a learning effect.
Eur. J. Oper. Res., 2009

Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates.
Comput. Oper. Res., 2009

Single-machine and flowshop scheduling with a general learning effect model.
Comput. Ind. Eng., 2009

A deteriorating jobs problem with quadratic function of job lateness.
Comput. Ind. Eng., 2009

2008
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects.
Inf. Sci., 2008

Single-machine group scheduling problems with deterioration consideration.
Comput. Oper. Res., 2008

A two-machine flowshop makespan scheduling problem with deteriorating jobs.
Comput. Ind. Eng., 2008

Scheduling deteriorating jobs on a single machine with release times.
Comput. Ind. Eng., 2008

Some scheduling problems with deteriorating jobs and learning effects.
Comput. Ind. Eng., 2008

2007
Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations.
Comput. Ind. Eng., 2007

2004
A bi-criterion single-machine scheduling problem with learning considerations.
Acta Informatica, 2004

2003
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine.
Inf. Process. Lett., 2003

2001
Minimizing the total flow time and the tardiness in a two-machine flow shop.
Int. J. Syst. Sci., 2001

2000
Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness.
Int. J. Syst. Sci., 2000


  Loading...