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

DOI10.1155/2020/9723439zbMATH Open1459.90098OpenAlexW3089083305MaRDI QIDQ2004254FDOQ2004254

Authors: 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

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

Mathematics Subject Classification ID

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

Cites Work

• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• 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
• Title not available (Why is that?)
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• 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

Cited In (9)

• Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
• Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
• 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
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• Two-stage assembly flow shop scheduling based on a hybrid VNS-EM algorithm
• Title not available (Why is that?)
• Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs
• 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)