A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness
From MaRDI portal
Publication:1793450
DOI10.1155/2016/6409321zbMath1400.90170OpenAlexW2485457262WikidataQ59140882 ScholiaQ59140882MaRDI QIDQ1793450
Publication date: 12 October 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/6409321
Related Items (2)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop
Cites Work
- Unnamed Item
- Unnamed Item
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- Minimizing total tardiness in permutation flowshops
- 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
- 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
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Optimal scheduling of the 3-machine assembly-type flow shop
- The Total Tardiness Problem: Review and Extensions
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- The three-stage assembly flowshop scheduling problem
This page was built for publication: A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness