A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
From MaRDI portal
Publication:933507
DOI10.1016/j.ejor.2007.08.030zbMath1149.90064OpenAlexW1994210759MaRDI QIDQ933507
Ching-Jong Liao, Chao-Tang Tseng
Publication date: 21 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.08.030
Related Items (16)
Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ A study on integration of lot sizing and flow shop lot streaming problems ⋮ Eidetic wolf search algorithm with a global memory structure ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ Genetic based discrete particle swarm optimization for elderly day care center timetabling ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ Lot streaming multiple jobs in a flow shop ⋮ Multicriteria models for just-in-time scheduling ⋮ An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem ⋮ Heuristic solution approaches for the cumulative capacitated vehicle routing problem ⋮ A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem ⋮ Minimizing maximum tardiness and delivery costs with batch delivery and job release times ⋮ Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness ⋮ A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design ⋮ An integrated tabu search algorithm for the lot streaming problem in job shops
Cites Work
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
- Flow shop scheduling with lot streaming
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
- Emerging Optimization Techniques in Production Planning and Control
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- Basic Techniques for Lot Streaming
- Variable neighborhood search: Principles and applications
- Unnamed Item
This page was built for publication: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
