An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem
From MaRDI portal
Publication:5174415
DOI10.1142/S0217595914500456zbMath1307.90075OpenAlexW2133940713MaRDI QIDQ5174415
Hongyan Sang, Xinyu Li, Liang Gao
Publication date: 17 February 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595914500456
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)
Related Items
Cites Work
- Iterated local search for the team orienteering problem with time windows
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Optimal lot streaming for multiple products in a two-machine flow shop
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- A large step random walk for minimizing total weighted tardiness in a job shop
- Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
- Improving local search heuristics for some scheduling problems. I
- Iterated local search for the quadratic assignment problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- Improving local search heuristics for some scheduling problems. II
