Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines

Flexible Flow Line ◽

Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines

Computers & Industrial Engineering ◽

10.1016/j.cie.2008.08.016 ◽

2009 ◽

Vol 56 (4) ◽

pp. 1393-1401 ◽

Cited By ~ 18

Author(s):

Chun-Lung Chen ◽

Chuen-Lung Chen

Keyword(s):

Parallel Machines ◽

Flow Line ◽

Total Tardiness ◽

Flexible Flow Line

A Heuristic Method for a Flexible Flow Line with Unrelated Parallel Machines Problem

2006 IEEE Conference on Robotics, Automation and Mechatronics ◽

10.1109/ramech.2006.252673 ◽

2006 ◽

Cited By ~ 1

Author(s):

Chun-lung Chen ◽

Chuen-lung Chen

Keyword(s):

Parallel Machines ◽

Flow Line ◽

Heuristic Method ◽

Flexible Flow Line

A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines

Computers & Operations Research ◽

10.1016/j.cor.2009.02.004 ◽

2009 ◽

Vol 36 (11) ◽

pp. 3073-3081 ◽

Cited By ~ 16

Author(s):

Chun-Lung Chen ◽

Chuen-Lung Chen

Keyword(s):

Parallel Machines ◽

Flow Line ◽

Flexible Flow Line

Minimizing the number of tardy jobs on unrelated parallel machines with dirt consideration

Journal of Industrial and Production Engineering ◽

10.1080/21681015.2018.1508082 ◽

2018 ◽

Vol 35 (6) ◽

pp. 383-393

Author(s):

Ling-Huey Su ◽

Ming-Chih Hsiao ◽

Hongming Zhou ◽

Fuh-Der Chou

Keyword(s):

Parallel Machines ◽

Number Of Tardy Jobs ◽

Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria

Journal of Scheduling ◽

10.1007/s10951-018-0583-z ◽

2018 ◽

Vol 22 (3) ◽

pp. 315-333 ◽

Cited By ~ 7

Author(s):

Yunqiang Yin ◽

Youhua Chen ◽

Kaida Qin ◽

Dujuan Wang

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Number Of Tardy Jobs ◽

Agent Scheduling ◽

Weighted Number ◽

A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs

International Journal of Production Research ◽

10.1080/00207543.2015.1033501 ◽

2015 ◽

Vol 53 (19) ◽

pp. 5977-5987 ◽

Cited By ~ 8

Author(s):

R. M’Hallah ◽

T. Al-Khamis

Keyword(s):

Parallel Machines ◽

Benders Decomposition ◽

Production Costs ◽

Scheduling Problem ◽

Decomposition Approach ◽

Number Of Tardy Jobs ◽

Weighted Number ◽

Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time

Annals of Operations Research ◽

10.1007/s10479-021-04043-x ◽

2021 ◽

Author(s):

Yang-Kuei Lin ◽

Tzu-Yueh Yin

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Weighted Completion Time ◽

A robust multi-response VNS-aiNet approach for solving scheduling problems under unrelated parallel machines environments

Expert Systems with Applications ◽

10.1016/j.eswa.2021.115140 ◽

2021 ◽

pp. 115140

Author(s):

Rodney Oliveira Marinho Diana ◽

Sérgio Ricardo de Souza ◽

Elizabeth Fialho Wanner

Keyword(s):

Parallel Machines ◽

Scheduling Problems

Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion ◽

Scheduling unrelated parallel machines with family setups and resource constraints to minimize total tardiness

10.1145/3377929.3398150 ◽

2020 ◽

Author(s):

Júlio C. S. N. Pinheiro ◽

José Elias C. Arroyo ◽

Lucas Batista Fialho

Keyword(s):

Parallel Machines ◽

Resource Constraints ◽

Total Tardiness ◽

Family Setups

Scheduling Unrelated Parallel Machines for an Industrial Production-Distribution Problem

IFAC Proceedings Volumes ◽

10.1016/s1474-6670(17)42307-x ◽

1997 ◽

Vol 30 (19) ◽

pp. 249-254

Author(s):

Clarisse Flipo

Keyword(s):

Industrial Production ◽

Parallel Machines ◽

Distribution Problem ◽

Production Distribution