A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines

International Journal of Production Economics ◽

10.1016/j.ijpe.2007.10.006 ◽

2008 ◽

Vol 113 (1) ◽

pp. 446-458 ◽

Author(s):

Shunji Tanaka ◽

Mituhiko Araki

Keyword(s):

Lagrangian Relaxation ◽

Branch And Bound ◽

Parallel Machines ◽

Total Tardiness ◽

Branch And Bound Algorithm ◽

Identical Parallel Machines

Download Full-text

A Branch and Bound Algorithm to Minimize Makespan on Identical Parallel Machines with Consumable Resources

Advances in Mechanical and Electronic Engineering - Lecture Notes in Electrical Engineering ◽

10.1007/978-3-642-31507-7_36 ◽

2012 ◽

pp. 217-221 ◽

Author(s):

Fayçal Belkaid ◽

Fouad Maliki ◽

Fethi Boudahri ◽

Zaki Sari

Keyword(s):

Branch And Bound ◽

Parallel Machines ◽

Branch And Bound Algorithm ◽

Identical Parallel Machines

Download Full-text

A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

2006 International Conference on Service Systems and Service Management ◽

10.1109/icsssm.2006.320678 ◽

2006 ◽

Author(s):

Rabia Nessah ◽

Farouk Yalaoui

Keyword(s):

Branch And Bound ◽

Completion Time ◽

Parallel Machines ◽

Branch And Bound Algorithm ◽

Total Weighted Completion Time ◽

Release Dates ◽

Identical Parallel Machines ◽

Weighted Completion Time

Download Full-text

An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

Journal of Systems Science and Systems Engineering ◽

10.1007/s11518-008-5065-y ◽

2008 ◽

Vol 17 (4) ◽

pp. 446-459 ◽

Author(s):

Belgacem Bettayeb ◽

Imed Kacem ◽

Kondo H. Adjallah

Keyword(s):

Branch And Bound ◽

Parallel Machines ◽

Setup Times ◽

Branch And Bound Algorithm ◽

Identical Parallel Machines ◽

Weighted Flowtime

Download Full-text

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

Computers & Operations Research ◽

10.1016/j.cor.2006.07.010 ◽

2008 ◽

Vol 35 (4) ◽

pp. 1176-1190 ◽

Author(s):

Rabia Nessah ◽

Farouk Yalaoui ◽

Chengbin Chu

Keyword(s):

Branch And Bound ◽

Completion Time ◽

Parallel Machines ◽

Branch And Bound Algorithm ◽

Total Weighted Completion Time ◽

Release Dates ◽

Identical Parallel Machines ◽

Weighted Completion Time

Download Full-text

A branch-and-bound algorithm to minimize total tardiness with different release dates

Naval Research Logistics (NRL) ◽

10.1002/1520-6750(199203)39:2<265::aid-nav3220390209>3.0.co;2-l ◽

1992 ◽

Vol 39 (2) ◽

pp. 265-283 ◽

Author(s):

Chengbin Chu

Keyword(s):

Branch And Bound ◽

Total Tardiness ◽

Branch And Bound Algorithm ◽

Download Full-text

Minimizing total tardiness for scheduling identical parallel machines with family setups

Computers & Industrial Engineering ◽

10.1016/j.cie.2014.04.001 ◽

2014 ◽

Vol 72 ◽

pp. 274-281 ◽

Author(s):

Jeffrey E. Schaller

Keyword(s):

Parallel Machines ◽

Total Tardiness ◽

Identical Parallel Machines ◽

Download Full-text

Note on Shim and Kim’s lower bounds for scheduling on identical parallel machines to minimize total tardiness

European Journal of Operational Research ◽

10.1016/j.ejor.2008.07.005 ◽

2009 ◽

Vol 197 (1) ◽

pp. 422-426 ◽

Author(s):

Jeffrey Schaller

Keyword(s):

Lower Bounds ◽

Parallel Machines ◽

Total Tardiness ◽

Identical Parallel Machines

Download Full-text

A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems

European Journal of Operational Research ◽

10.1016/j.ejor.2004.12.023 ◽

2006 ◽

Vol 174 (1) ◽

pp. 1-10 ◽

Author(s):

Chia-Shin Chung ◽

James Flynn ◽

Ömer Kirca

Keyword(s):

Branch And Bound ◽

Total Tardiness ◽

Branch And Bound Algorithm ◽

Permutation Flowshop

Download Full-text

A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of a Three-Agent Scheduling Problem Considering the Overlap Effect and Environmental Protection

IEEE Access ◽

10.1109/access.2018.2888569 ◽

2019 ◽

Vol 7 ◽

pp. 5106-5123 ◽

Author(s):

Jen-Ya Wang

Keyword(s):

Environmental Protection ◽

Branch And Bound ◽

Total Tardiness ◽

Branch And Bound Algorithm ◽

Scheduling Problem ◽

Agent Scheduling

Download Full-text

A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time

Journal of Advanced Mechanical Design Systems and Manufacturing ◽

10.1299/jamdsm.2019jamdsm0080 ◽

2019 ◽

Vol 13 (4) ◽

pp. JAMDSM0080-JAMDSM0080

Author(s):

June-Young BANG ◽

BongJoo JEONG

Keyword(s):

Branch And Bound ◽

Total Tardiness ◽

Branch And Bound Algorithm ◽

Release Time ◽

Flowshop Problem

Download Full-text