Some local search algorithms for no-wait flow-shop problem with makespan criterion
From MaRDI portal
Publication:2387266
DOI10.1016/j.cor.2004.02.009zbMath1068.90058MaRDI QIDQ2387266
Jozef Grabowski, Jaroslaw Pempera
Publication date: 2 September 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.02.009
Related Items
A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem, A multiperiod single processor scheduling problem with periodic requirements, On no-wait and no-idle flow shops with makespan criterion, A multi-objective particle swarm for a flow shop scheduling problem, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems, An empirical analysis of the optimality rate of flow shop heuristics, A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems, No-wait flow shop scheduling using fuzzy multi-objective linear programming, A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, An improved NEH heuristic to minimize makespan in permutation flow shops, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
Cites Work
- Unnamed Item
- Unnamed Item
- A genetic algorithm for flowshop sequencing
- New heuristics for no-wait flowshops to minimize makespan.
- Approximative procedures for no-wait job shop scheduling.
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- Sequencing of jobs in some production system
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- Two-Machine No-Wait Flow Shop Scheduling with Missing Operations
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Tabu Search—Part I
- Tabu Search—Part II
- Solutions to the Constrained Flowshop Sequencing Problem
- Ordonnancements à contraintes disjonctives
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- New block properties for the permutation flow shop problem with application in tabu search
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- 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
