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

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

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

European Journal of Operational Research ◽

10.1016/j.ejor.2003.08.026 ◽

2005 ◽

Vol 161 (1) ◽

pp. 3-10 ◽

Author(s):

Cherif Sadfi ◽

Bernard Penz ◽

Christophe Rapine ◽

Jacek Błażewicz ◽

Piotr Formanowicz

Keyword(s):

Approximation Algorithm ◽

Single Machine ◽

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Availability Constraints ◽

Time Scheduling

Download Full-text

An iterative heuristic for the single machine dynamic total completion time scheduling problem

Computers & Operations Research ◽

10.1016/0305-0548(95)00071-2 ◽

1996 ◽

Vol 23 (7) ◽

pp. 641-651 ◽

Author(s):

Suresh Chand ◽

Rodney Traub ◽

Reha Uzsoy

Keyword(s):

Single Machine ◽

Completion Time ◽

Total Completion Time ◽

Scheduling Problem ◽

Time Scheduling

Download Full-text

Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-008-1762-4 ◽

2008 ◽

Vol 43 (7-8) ◽

pp. 810-821 ◽

Author(s):

Fuh-Der Chou ◽

Hui-Mei Wang ◽

Tzu-Yun Chang

Keyword(s):

Single Machine ◽

Completion Time ◽

Total Weighted Completion Time ◽

Scheduling Problem ◽

Release Times ◽

Sequence Dependent ◽

Time Scheduling ◽

Weighted Completion Time

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

Single-machine total completion time scheduling with a time-dependent deterioration

Applied Mathematical Modelling ◽

10.1016/j.apm.2010.09.028 ◽

2011 ◽

Vol 35 (3) ◽

pp. 1506-1511 ◽

Author(s):

Ji-Bo Wang ◽

Lin-Hui Sun ◽

Lin-Yan Sun

Keyword(s):

Single Machine ◽

Completion Time ◽

Time Dependent ◽

Total Completion Time ◽

Time 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

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Computers & Operations Research ◽

10.1016/j.cor.2011.05.024 ◽

2012 ◽

Vol 39 (3) ◽

pp. 471-478 ◽

Author(s):

Rabia Nessah ◽

Imed Kacem

Keyword(s):

Branch And Bound ◽

Single Machine ◽

Completion Time ◽

Release Dates ◽

Scheduling Problem ◽

Branch And Bound Method ◽

Time Scheduling ◽

Weighted Completion Time

Download Full-text

A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem

European Journal of Operational Research ◽

10.1016/j.ejor.2009.07.025 ◽

2010 ◽

Vol 203 (2) ◽

pp. 316-320 ◽

Author(s):

Krzysztof M. Ocetkiewicz

Keyword(s):

Single Machine ◽

Completion Time ◽

Time Dependent ◽

Total Completion Time ◽

Scheduling Problem ◽

Download Full-text

The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

European Journal of Operational Research ◽

10.1016/j.ejor.2013.08.013 ◽

2014 ◽

Vol 233 (1) ◽

pp. 64-74 ◽

Author(s):

Dvir Shabtay

Keyword(s):

Single Machine ◽

Completion Time ◽

Batch Scheduling ◽

Total Completion Time ◽

Scheduling Problem ◽

Download Full-text