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

DOI10.1155/2020/9723439MaRDI QIDQ2004254zbMATH OpenOpenAlexFDO

Authors Ik-Sun Lee

Publication date 14 October 2020

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• Heuristics for minimizing total weighted tardiness in flexible flow shops
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic

Cites work

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

Cited in

(9)

• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
• A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
• scientific article; zbMATH DE number 6673363 (Why is no real title available?)
• Two-stage assembly flow shop scheduling based on a hybrid VNS-EM algorithm
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004254)