A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop

DOI10.1155/2020/9723439zbMath1459.90098OpenAlexW3089083305MaRDI QIDQ2004254

Ik-Sun Lee

Publication date: 14 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/9723439

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• Unnamed Item
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• Note on minimizing total tardiness in a two-machine flowshop
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop