A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time

DOI10.1155/2016/1257060zbMath1400.90179OpenAlexW2548486980WikidataQ59130707 ScholiaQ59130707MaRDI QIDQ1792653

Kun Li, Huixin Tian, Wei Liu

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/1257060

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant ⋮ Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints

Cites Work

• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
• Variable neighbourhood search: methods and applications
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• Flowshop scheduling with identical jobs and uniform parallel machines
• Variable neighborhood search
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• Heuristics for minimizing total weighted tardiness in flexible flow shops
• Sequencing of jobs in some production system
• Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
• A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
• Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times
• Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations
• Scheduling flexible flow lines with sequence-dependent setup times
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Flexible flow shop scheduling with uniform parallel machines
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time

This page was built for publication: A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time