An iterated greedy algorithm for the planning of yarn‐dyeing boilers

DOI10.1111/itor.13232OpenAlexW4309325032MaRDI QIDQ6060692

Yunus Demir

Publication date: 29 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13232

zbMATH Keywords

mixed integer programmingiterated greedy algorithmvariable-sized bin packingyarn/bobbin dyeing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• Online variable-sized bin packing with conflicts
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
• A new version of on-line variable-sized bin packing
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Heuristics for the variable sized bin-packing problem
• Online variable-sized bin packing
• VNS matheuristic for a bin packing problem with a color constraint
• Efficient algorithms for real-life instances of the variable size bin packing problem
• Variable neighbourhood search for the variable sized bin packing problem
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Algorithms for the variable sized bin packing problem
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• Efficient algorithms for the offline variable sized bin-packing problem
• Solving the variable size bin packing problem with discretized formulations
• A survey of scheduling problems with setup times or costs
• The class constrained bin packing problem with applications to video-on-demand
• Accelerating column generation for variable sized bin-packing problems
• Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
• The Trim Problem
• New Bounds for Variable-Sized Online Bin Packing
• Note: A local-search heuristic for large set-covering problems
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• The Loading Problem
• On two class-constrained versions of the multiple knapsack problem

This page was built for publication: An iterated greedy algorithm for the planning of yarn‐dyeing boilers