A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

DOI10.1080/0305215X.2019.1632303MaRDI QIDQ5059372zbMATH OpenOpenAlexWikidataFDO

Authors Chin-Chia Wu, Danyu Bai, Ameni Azzouz, I-Hong Chung, Shuenn-Ren Cheng, Dwueng-Chwuan Jhwueng, Win-Chin Lin, Lamjed ben Said

Publication date 23 December 2022

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2019.1632303

zbMATH Keywords

genetic algorithmsimulated annealingtwo-stage assembly

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
• Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
• Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function
• A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic

Cites work

• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• A hybrid tabu search heuristic for the two-stage assembly scheduling problem
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
• A state-of-the-art review on scheduling with learning effects
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
• Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Nonparametric statistical methods
• Optimal two- and three-stage production schedules with set-up time included
• Optimization by simulated annealing
• Research on m‐machine flow shop scheduling with truncated learning effects
• Single machine scheduling with learning effect considerations
• Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
• Single-machine scheduling with learning considerations
• Some scheduling problems with general position-dependent and time-dependent learning effects
• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• The three-stage assembly flowshop scheduling problem
• The two-machine total completion time flow shop problem
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

Cited in

(8)

• The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
• Two-stage assembly scheduling with batch setup times, time-dependent deterioration, and preventive maintenance activities using meta-heuristic algorithms
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
• The due date assignment scheduling problem with the deteriorating jobs and delivery time
• Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
• A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms
• Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop
• Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function

This page was built for publication: A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

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