A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
From MaRDI portal
Publication:2794678
DOI10.1111/itor.12105zbMath1332.90108OpenAlexW2110515532WikidataQ57912597 ScholiaQ57912597MaRDI QIDQ2794678
Publication date: 11 March 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12105
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Research on m‐machine flow shop scheduling with truncated learning effects ⋮ Emergency scheduling of engineering rescue tasks in disaster relief operations and its application in China
Cites Work
- Unnamed Item
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- Modeling realistic hybrid flexible flowshop scheduling problems
- Lot streaming with detached setups in three-machine flow shops
- Optimal streaming of a single job in a two-stage flow shop
- Lot streaming in three-stage production processes
- Scheduling and lot streaming in flowshops with no-wait in process
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- On the convergence of parallel simulated annealing
- Flow shop scheduling with lot streaming
- Lot streaming models with a limited number of capacitated transporters in multistage batch production systems
- Adaptive temperature control for simulated annealing: a comparative study
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Lot streaming in the two-machine flow shop with setup times
- The hybrid flow shop scheduling problem
- Single-job lot streaming in \(m - 1\) two-stage hybrid flowshops
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Solving the simple plant location problem by genetic algorithm
- Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
- On the Convergence Rate of Annealing Processes
- Two- and three-machine flow shop scheduling problems with equal sized transfer batches
- Basic Techniques for Lot Streaming
- Lot streaming in a multiple product permutation flow shop with intermingling
- Lot streaming with variable sublots: an integer programming formulation
This page was built for publication: A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
