Two competitive agents to minimize the weighted total late work and the total completion time

Applied Mathematics and Computation ◽

10.1016/j.amc.2021.126286 ◽

2021 ◽

Vol 406 ◽

pp. 126286

Author(s):

Xingong Zhang

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Download Full-text

Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times

Journal of the Operational Research Society ◽

10.1038/sj.jors.2601110 ◽

2001 ◽

Vol 52 (4) ◽

pp. 449-462

Author(s):

A Allahverdi ◽

T Aldowaisan

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Sequence Dependent ◽

Changeover Times ◽

Download Full-text

Minimization of the total completion time for a single scheduling with learning effect and setup times consideration

Industrial Electronics and Engineering ◽

10.2495/iciee140841 ◽

2014 ◽

Author(s):

Yuling Yeh ◽

Chinyao Low ◽

Wen-Yi Lin

Keyword(s):

Completion Time ◽

Learning Effect ◽

Setup Times ◽

Total Completion Time

Download Full-text

Single-Machine Sustainable Production Planning to Minimize Total Energy Consumption and Total Completion Time Using a Multiple Objective Genetic Algorithm

IEEE Transactions on Engineering Management ◽

10.1109/tem.2011.2171055 ◽

2012 ◽

Vol 59 (4) ◽

pp. 585-597 ◽

Author(s):

Mehmet Bayram Yildirim ◽

Gilles Mouzon

Keyword(s):

Genetic Algorithm ◽

Energy Consumption ◽

Total Energy ◽

Production Planning ◽

Single Machine ◽

Completion Time ◽

Sustainable Production ◽

Total Completion Time ◽

Multiple Objective ◽

Total Energy Consumption

Download Full-text

Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect

Natural Computing ◽

10.1007/s11047-016-9539-4 ◽

2016 ◽

Vol 18 (2) ◽

pp. 287-299

Author(s):

Chunhui Zheng ◽

Huaping Chen ◽

Rui Xu

Keyword(s):

Tabu Search ◽

Single Machine ◽

Completion Time ◽

Learning Effect ◽

Search Algorithms ◽

Time Dependent ◽

Total Completion Time ◽

Actual Time ◽

Dependent Learning

Download Full-text

Minimizing the total completion time in a unit-time open shop with release times

Operations Research Letters ◽

10.1016/s0167-6377(97)00015-1 ◽

1997 ◽

Vol 20 (5) ◽

pp. 207-212 ◽

Author(s):

Thomas Tautenhahn ◽

Gerhard J. Woeginger

Keyword(s):

Completion Time ◽

Open Shop ◽

Total Completion Time ◽

Download Full-text

A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates

2009 International Conference on Computers & Industrial Engineering ◽

10.1109/iccie.2009.5223879 ◽

2009 ◽

Author(s):

Mohamed Ali Rakrouki ◽

Talel Ladhari

Keyword(s):

Branch And Bound ◽

Completion Time ◽

Branch And Bound Algorithm ◽

Total Completion Time ◽

Release Dates ◽

Flowshop Problem

Download Full-text

Minimizing total completion time in two-machine flow shops with exact delay using genetic algorithm & ant colony algorithm

Proceedings of the 11th annual conference companion on Genetic and evolutionary computation conference - GECCO '09 ◽

10.1145/1570256.1570397 ◽

2009 ◽

Author(s):

Josh Glascock ◽

Brian Hunter

Keyword(s):

Genetic Algorithm ◽

Completion Time ◽

Ant Colony Algorithm ◽

Total Completion Time ◽

Download Full-text

Minimize the Sum of Total Completion Time and Total Rejection Penalties on a Single Parallel Batching Machine

2010 WASE International Conference on Information Engineering ◽

10.1109/icie.2010.143 ◽

2010 ◽

Author(s):

Xiuqian Li ◽

Haodi Feng

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Parallel Batching ◽

Batching Machine

Download Full-text

Single machine batch processing problem with release dates to minimize total completion time

International Journal of Industrial Engineering Computations ◽

10.5267/j.ijiec.2017.8.003 ◽

2018 ◽

pp. 331-348 ◽

Author(s):

Pedram Beldar ◽

Antonio Costa

Keyword(s):

Single Machine ◽

Completion Time ◽

Batch Processing ◽

Total Completion Time ◽

Release Dates ◽

Processing Problem

Download Full-text

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

Optimization Letters ◽

10.1007/s11590-013-0655-0 ◽

2013 ◽

Vol 8 (4) ◽

pp. 1577-1589 ◽

Author(s):

Eduardo Conde

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Unrelated Parallel Machines ◽

Download Full-text