Bi-Objective Optimal Scheduling With Raw Material’s Shelf-Life Constraints in Unrelated Parallel Machines Production

Ming-Zheng Wang; Ling-Ling Zhang; Tsan-Ming Choi

doi:10.1109/tsmc.2018.2855700

Bi-Objective Optimal Scheduling With Raw Material’s Shelf-Life Constraints in Unrelated Parallel Machines Production

IEEE Transactions on Systems Man and Cybernetics Systems ◽

10.1109/tsmc.2018.2855700 ◽

2020 ◽

Vol 50 (11) ◽

pp. 4598-4610

Author(s):

Ming-Zheng Wang ◽

Ling-Ling Zhang ◽

Tsan-Ming Choi

Keyword(s):

Shelf Life ◽

Parallel Machines ◽

Optimal Scheduling ◽

Unrelated Parallel Machines

Download Full-text

Solving the economic lot and delivery scheduling problem in a flexible job shop with unrelated parallel machines and a shelf life by a proposed hybrid PSO

The International Journal of Advanced Manufacturing Technology ◽

10.1007/s00170-013-4930-0 ◽

2013 ◽

Vol 68 (5-8) ◽

pp. 1401-1416 ◽

Cited By ~ 5

Author(s):

S. Dousthaghi ◽

R. Tavakkoli-Moghaddam ◽

A. Makui

Keyword(s):

Shelf Life ◽

Parallel Machines ◽

Job Shop ◽

Flexible Job Shop ◽

Scheduling Problem ◽

Unrelated Parallel Machines ◽

Lot And Delivery Scheduling ◽

Delivery Scheduling

Download Full-text

An efficient parametric algorithm for optimal scheduling of unrelated parallel machines with release dates

Science Bulletin of the Novosibirsk State Technical University ◽

10.17212/1814-1196-2018-3-87-106 ◽

2018 ◽

pp. 87-106

Author(s):

Yuriy Mesentsev ◽

◽

Igor Estraykh ◽

Keyword(s):

Parallel Machines ◽

Optimal Scheduling ◽

Release Dates ◽

Unrelated Parallel Machines ◽

Parametric Algorithm

Download Full-text

An economic lot and delivery scheduling problem with the fuzzy shelf life in a flexible job shop with unrelated parallel machines

International Journal of Industrial Engineering Computations ◽

10.5267/j.ijiec.2012.04.001 ◽

2012 ◽

Vol 3 (4) ◽

pp. 663-680 ◽

Cited By ~ 1

Author(s):

S Dousthaghi ◽

R Tavakkoli-Moghaddam

Keyword(s):

Shelf Life ◽

Parallel Machines ◽

Job Shop ◽

Flexible Job Shop ◽

Scheduling Problem ◽

Unrelated Parallel Machines ◽

Lot And Delivery Scheduling ◽

Delivery Scheduling

Download Full-text

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 ◽

Unrelated Parallel Machines ◽

Scheduling Problems

Download Full-text

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

Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion ◽

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 ◽

Unrelated Parallel Machines ◽

Family Setups

Download Full-text

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 ◽

Unrelated Parallel Machines ◽

Distribution Problem ◽

Production Distribution

Download Full-text

Exact methods for order acceptance and scheduling on unrelated parallel machines

Computers & Operations Research ◽

10.1016/j.cor.2018.12.016 ◽

2019 ◽

Vol 104 ◽

pp. 159-173 ◽

Cited By ~ 5

Author(s):

Shijin Wang ◽

Benyan Ye

Keyword(s):

Parallel Machines ◽

Unrelated Parallel Machines ◽

Order Acceptance ◽

Exact Methods ◽

Order Acceptance And Scheduling

Download Full-text

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

Optimization Letters ◽

10.1007/s11590-013-0655-0 ◽

2013 ◽

Vol 8 (4) ◽

pp. 1577-1589 ◽

Cited By ~ 7

Author(s):

Eduardo Conde

Keyword(s):

Completion Time ◽

Parallel Machines ◽

Total Completion Time ◽

Unrelated Parallel Machines ◽

Minmax Regret

Download Full-text

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Computers & Operations Research ◽

10.1016/j.cor.2013.01.018 ◽

2013 ◽

Vol 40 (7) ◽

pp. 1829-1841 ◽

Cited By ~ 45

Author(s):

Francisco J. Rodriguez ◽

Manuel Lozano ◽

Christian Blum ◽

Carlos García-Martínez

Keyword(s):

Greedy Algorithm ◽

Large Scale ◽

Parallel Machines ◽

Scheduling Problem ◽

Unrelated Parallel Machines ◽

Parallel Machines Scheduling ◽

Iterated Greedy Algorithm ◽

Iterated Greedy ◽

Unrelated Parallel Machines Scheduling

Download Full-text

Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times

International Transactions in Operational Research ◽

10.1111/itor.12566 ◽

2018 ◽

Vol 28 (2) ◽

pp. 996-1017 ◽

Cited By ~ 2

Author(s):

Luciano P. Cota ◽

Vitor N. Coelho ◽

Frederico G. Guimarães ◽

Marcone J. F. Souza

Keyword(s):

Parallel Machines ◽

Setup Times ◽

Unrelated Parallel Machines ◽

Sequence Dependent ◽

Sequence Dependent Setup ◽

Dependent Setup Times ◽

Sequence Dependent Setup Times

Download Full-text