Minimizing the Total Completion Time for the TFT-Array Factory Scheduling Problem (TAFSP)

Lecture Notes in Computer Science - Computational Science and Its Applications – ICCSA 2007 ◽

10.1007/978-3-540-74472-6_63 ◽

2007 ◽

pp. 767-778 ◽

Author(s):

A. H. I. Lee ◽

S. H. Chung ◽

C. Y. Huang

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Factory Scheduling

Download Full-text

Single machine multi-criteria scheduling problem: total completion time, maximum lateness, and maximum earliness performance measures

International Journal of Planning and Scheduling ◽

10.1504/ijps.2021.10038283 ◽

2021 ◽

Vol 3 (2) ◽

pp. 140

Author(s):

Ganiyu O. Ajisegiri ◽

Saheed Akande

Keyword(s):

Performance Measures ◽

Single Machine ◽

Completion Time ◽

Maximum Lateness ◽

Total Completion Time ◽

Scheduling Problem ◽

Maximum Earliness

Download Full-text

An iterated local search and tabu search for two-parallel machine scheduling problem to minimize the maximum total completion time

Journal of Information and Optimization Sciences ◽

10.1080/02522667.2018.1468610 ◽

2019 ◽

Vol 40 (3) ◽

pp. 751-766 ◽

Author(s):

Jianyou Xu ◽

Shang-Chia Liu ◽

Chuanli Zhao ◽

Junjie Wu ◽

Win-Chin Lin ◽

...

Keyword(s):

Tabu Search ◽

Local Search ◽

Completion Time ◽

Machine Scheduling ◽

Parallel Machine Scheduling ◽

Parallel Machine ◽

Iterated Local Search ◽

Total Completion Time ◽

Scheduling Problem ◽

Parallel Machine Scheduling Problem

Download Full-text

Distributed permutation flowshop scheduling problem with total completion time objective

OPSEARCH ◽

10.1007/s12597-020-00484-3 ◽

2020 ◽

Author(s):

Arshad Ali ◽

Yuvraj Gajpal ◽

Tarek Y. Elmekkawy

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Permutation Flowshop ◽

Flowshop Scheduling Problem

Download Full-text

A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness

INFOR Information Systems and Operational Research ◽

10.3138/infor.45.2.75 ◽

2007 ◽

Vol 45 (2) ◽

pp. 75-81 ◽

Author(s):

Tamer Eren ◽

Ertan Güner

Keyword(s):

Completion Time ◽

Learning Effect ◽

Total Tardiness ◽

Total Completion Time ◽

Scheduling Problem ◽

Bicriteria Scheduling

Download Full-text

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

Operations Research Letters ◽

10.1016/s0167-6377(03)00007-5 ◽

2003 ◽

Vol 31 (4) ◽

pp. 323-326 ◽

Author(s):

C.T. Ng ◽

T.C.E. Cheng ◽

J.J. Yuan ◽

Z.H. Liu

Keyword(s):

Single Machine ◽

Completion Time ◽

Precedence Constraints ◽

Total Completion Time ◽

Release Dates ◽

Scheduling Problem ◽

Processing Times

Download Full-text

The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic

Computers & Operations Research ◽

10.1016/j.cor.2017.07.012 ◽

2017 ◽

Vol 88 ◽

pp. 237-246 ◽

Author(s):

Jose M. Framinan ◽

Paz Perez-Gonzalez

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Constructive Heuristic ◽

Flowshop Scheduling Problem ◽

Assembly Flowshop Scheduling ◽

Assembly Flowshop

Download Full-text

Single machine total completion time scheduling problem with workload-dependent maintenance duration

Omega ◽

10.1016/j.omega.2014.11.002 ◽

2015 ◽

Vol 52 ◽

pp. 101-106 ◽

Author(s):

Dehua Xu ◽

Long Wan ◽

Aihua Liu ◽

Dar-Li Yang

Keyword(s):

Single Machine ◽

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Time Scheduling

Download Full-text

Flowshop scheduling problem to minimize total completion time with random and bounded processing times

Journal of the Operational Research Society ◽

10.1057/palgrave.jors.2601682 ◽

2004 ◽

Vol 55 (3) ◽

pp. 277-286 ◽

Author(s):

Y N Sotskov ◽

A Allahverdi ◽

T-C Lai

Keyword(s):

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Flowshop Scheduling ◽

Processing Times ◽

Flowshop Scheduling Problem ◽

Bounded Processing Times

Download Full-text

A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

Engineering Optimization ◽

10.1080/0305215x.2019.1632303 ◽

2019 ◽

Vol 52 (6) ◽

pp. 1009-1036 ◽

Author(s):

Chin-Chia Wu ◽

Danyu Bai ◽

Ameni Azzouz ◽

I.-Hong Chung ◽

Shuenn-Ren Cheng ◽

...

Keyword(s):

Branch And Bound ◽

Completion Time ◽

Flow Shop ◽

Branch And Bound Algorithm ◽

Flow Shop Scheduling ◽

Total Completion Time ◽

Scheduling Problem ◽

Two Stage ◽

Shop Scheduling

Download Full-text

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem

Information Processing Letters ◽

10.1016/s0020-0190(01)00274-5 ◽

2002 ◽

Vol 82 (4) ◽

pp. 187-191 ◽

Author(s):

C.T. Ng ◽

T.C.E. Cheng ◽

J.J. Yuan

Keyword(s):

Single Machine ◽

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Time Scheduling ◽

Download Full-text