An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

DOI10.1016/J.COR.2022.105733OpenAlexW4210369713MaRDI QIDQ2146995FDOQ2146995

Authors Yanyan Li

Publication date 22 June 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2022.105733

zbMATH Keywords

constraint programmingmixed-integer programmingsequence-dependent setup timesevolution strategydistributed flowshop scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The distributed permutation flowshop scheduling problem
• Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
• Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem

Cites work

• scientific article; zbMATH DE number 3541882 (Why is no real title available?)
• scientific article; zbMATH DE number 1406244 (Why is no real title available?)
• A comprehensive review and evaluation of permutation flowshop heuristics
• A graph-based constraint programming approach for the integrated process planning and scheduling problem
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Benchmarks for basic scheduling problems
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Constraint programming model for multi-manned assembly line balancing problem
• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
• FLOWSHOP SCHEDULES WITH SEQUENCE DEPENDENT SETUP TIMES
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
• Handbook of constraint programming.
• Heuristics for the flow line problem with setup costs
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Record breaking optimization results using the ruin and recreate principle
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Some efficient heuristic methods for the flow shop sequencing problem
• The distributed permutation flowshop scheduling problem
• The third comprehensive survey on scheduling problems with setup times/costs
• The two-machine sequence dependent flowshop scheduling problem

Cited in

(8)

• A review and classification on distributed permutation flowshop scheduling problems
• The distributed no-idle permutation flowshop scheduling problem with due windows
• Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
• Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups
• An effective differential evolution algorithm for permutation flow shop scheduling problem
• Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm

This page was built for publication: An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

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