An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

Operations Research Letters ◽

10.1016/s0167-6377(03)00048-8 ◽

2003 ◽

Vol 31 (6) ◽

pp. 492-496 ◽

Author(s):

Yunpeng Pan

Keyword(s):

Branch And Bound ◽

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Branch And Bound Algorithm ◽

Total Weighted Completion Time ◽

Weighted Completion Time

Download Full-text

Single-machine scheduling with operator non-availability to minimize total weighted completion time

Information Sciences ◽

10.1016/j.ins.2018.03.005 ◽

2018 ◽

Vol 445-446 ◽

pp. 1-5 ◽

Author(s):

Long Wan ◽

Jinjiang Yuan

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Weighted Completion Time

Download Full-text

A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

Operations Research Letters ◽

10.1016/j.orl.2016.07.016 ◽

2016 ◽

Vol 44 (5) ◽

pp. 676-679 ◽

Author(s):

Martin Skutella

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Release Dates ◽

Weighted Completion Time

Download Full-text

A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time

Management Science ◽

10.1287/mnsc.31.10.1300 ◽

1985 ◽

Vol 31 (10) ◽

pp. 1300-1311 ◽

Author(s):

C. N. Potts

Keyword(s):

Branch And Bound ◽

Single Machine ◽

Completion Time ◽

Precedence Constraints ◽

Branch And Bound Algorithm ◽

Total Weighted Completion Time ◽

Weighted Completion Time

Download Full-text

ON SINGLE-MACHINE SCHEDULING WITH RELEASE TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME

Journal of the Chinese Institute of Industrial Engineers ◽

10.1080/10170660409509436 ◽

2004 ◽

Vol 21 (6) ◽

pp. 567-575 ◽

Author(s):

Pei-Chann Chang ◽

Yun-Kung Chung ◽

Jih-Chang Hsieh

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Release Times ◽

Weighted Completion Time

Download Full-text

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

Operations Research Letters ◽

10.1016/j.orl.2016.09.013 ◽

2016 ◽

Vol 44 (6) ◽

pp. 772-774 ◽

Author(s):

Leah Epstein ◽

Asaf Levin

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Weighted Completion Time

Download Full-text

Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect

Applied Mathematics and Computation ◽

10.1016/j.amc.2008.12.001 ◽

2009 ◽

Vol 208 (2) ◽

pp. 355-358 ◽

Author(s):

Tamer Eren

Keyword(s):

Single Machine ◽

Completion Time ◽

Learning Effect ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Release Dates ◽

Weighted Completion Time

Download Full-text

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

Computers & Operations Research ◽

10.1016/j.cor.2015.08.010 ◽

2016 ◽

Vol 66 ◽

pp. 141-152 ◽

Author(s):

Jordi Pereira

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Processing Times ◽

Minmax Regret ◽

Weighted Completion Time ◽

Interval Processing Times

Download Full-text

Single machine scheduling with two-agent for total weighted completion time objectives

Applied Soft Computing ◽

10.1016/j.asoc.2018.05.027 ◽

2018 ◽

Vol 70 ◽

pp. 147-156 ◽

Author(s):

Hongwei Li ◽

Yuvraj Gajpal ◽

C.R. Bector

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Weighted Completion Time

Download Full-text

Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives

Annals of Operations Research ◽

10.1007/s10479-017-2515-2 ◽

2017 ◽

Vol 269 (1-2) ◽

pp. 623-640

Author(s):

Shesh Narayan Sahu ◽

Yuvraj Gajpal ◽

Swapan Debbarma

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Agent Based ◽

Weighted Completion Time

Download Full-text

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

Optimization Methods and Software ◽

10.1080/10556788.2013.854360 ◽

2013 ◽

Vol 29 (5) ◽

pp. 955-963 ◽

Author(s):

Mikhail Batsyn ◽

Boris Goldengorin ◽

Panos M. Pardalos ◽

Pavel Sukhov

Keyword(s):

Single Machine ◽

Completion Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Total Weighted Completion Time ◽

Scheduling Problem ◽

Weighted Completion Time

Download Full-text