A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
Summary: This paper considers an assembly scheduling problem which minimizes the total weighted tardiness. The system consists of multiple manufacturing machines in the first stage and an assembly machine in the second stage. A job is composed of multiple components, each component is manufactured on a dedicated machine in the first stage, and the assembly starts on the assembly machine after the completion of all the components' manufacturing in the first stage. This paper is to try to find effective and efficient schedules to minimize the total weighted tardiness of jobs. This paper analyzes some solution properties to improve search effectiveness and efficiency. Moreover, some lower-bound procedures are derived, and then four constructive heuristics and a branch-and-bound algorithm are suggested. The performances of the derived algorithms are evaluated through numerical experiments. For the problems with no more than 15 jobs, the branch-and-bound algorithm finds the optimal solutions within 20 minutes, and the performance of the four heuristics seems to be similar. However, for problems with more than 30 jobs, \(\mathrm{H_{WT}}\) shows the best performance among the four heuristics except for two machines.
- 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
- 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 PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- 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
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- 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
- 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
- A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- 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
- scientific article; zbMATH DE number 6673363 (Why is no real title available?)
- Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
- Two-stage assembly flow shop scheduling based on a hybrid VNS-EM algorithm
- New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: a computational evaluation
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
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)
