Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems

DOI10.1016/j.cor.2018.12.008zbMath1458.90385OpenAlexW2905262274WikidataQ128773627 ScholiaQ128773627MaRDI QIDQ1725606

Vahid Roshanaei, Mohammad Mohammadi, Hassan Zohali, Bahman Naderi

Publication date: 14 February 2019

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

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

zbMATH Keywords

linearizationsequencinglot-sizinghybrid flow shopmixed-integer nonlinear programmixed-integer linear programhybrid iterated local search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (2)

DILS: constrained clustering through dual iterative local search ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

Uses Software

• CPLEX

Cites Work

• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
• Algorithms for a realistic variant of flowshop scheduling
• Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case
• Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
• Optimization of economic lot scheduling problem with backordering and shelf-life considerations using calibrated metaheuristic algorithms
• A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes
• Cyclic scheduling to minimize inventory in a batch flow line
• Variable neighborhood search
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
• Heuristics for scheduling in a flow shop with multiple processors
• A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
• Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production
• The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops
• An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem

This page was built for publication: Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems