Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
From MaRDI portal
Publication:976399
DOI10.1016/j.ejor.2010.02.014zbMath1188.90115OpenAlexW2093545304MaRDI QIDQ976399
Chuyang Wang, Qian Wang, Xiao-Ping Li
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.014
Related Items
An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem ⋮ A survey of scheduling problems with no-wait in process
Uses Software
Cites Work
- Unnamed Item
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Variable neighbourhood search: Methods and applications
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- New heuristics for no-wait flowshops to minimize makespan.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Sequencing of jobs in some production system
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- A decomposition algorithm for the single machine total tardiness problem
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A comparison of local search methods for flow shop scheduling
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
- Principles of scatter search
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- Some new results in flow shop scheduling
- Tabu Search—Part I
- Solutions to the Constrained Flowshop Sequencing Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Comparison of iterative searches for the quadratic assignment problem
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Multiple Comparison Methods for Means
- Scheduling in flowshops to minimize total tardiness of jobs
- Heuristic for no-wait flow shops with makespan minimization
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Variable neighborhood search: Principles and applications
- Experimental evaluation of heuristic optimization algorithms: A tutorial
