Wen-Chiung Lee
According to our database1,
Wen-Chiung Lee
authored at least 59 papers
between 2000 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
RAIRO Oper. Res., 2020
2018
Math. Comput. Simul., 2018
Proceedings of the 7th International Congress on Advanced Applied Informatics, 2018
2017
Comput. Ind. Eng., 2017
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
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
Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions.
Comput. Ind. Eng., 2014
2013
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
Appl. Math. Comput., 2013
2012
Uniform parallel-machine scheduling to minimize makespan with position-based learning curves.
Comput. Ind. Eng., 2012
Appl. Soft Comput., 2012
Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs.
Appl. Math. Comput., 2012
2011
Inf. Sci., 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
Comput. Ind. Eng., 2011
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
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
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
Comput. Ind. Eng., 2009
Comput. Ind. Eng., 2009
2008
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects.
Inf. Sci., 2008
Comput. Oper. Res., 2008
Comput. Ind. Eng., 2008
Comput. Ind. Eng., 2008
Comput. Ind. Eng., 2008
2007
Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations.
Comput. Ind. Eng., 2007
2004
Acta Informatica, 2004
2003
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine.
Inf. Process. Lett., 2003
2001
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