Some local search algorithms for no-wait flow-shop problem with makespan criterion

DOI10.1016/j.cor.2004.02.009zbMath1068.90058OpenAlexW1979763505MaRDI QIDQ2387266

Jaroslaw Pempera, Jozef Grabowski

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

zbMATH Keywords

Tabu searchMakespanLocal searchNo-waitEmpirical evaluationFlow-shop scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items

A multiperiod single processor scheduling problem with periodic requirements ⋮ Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ 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 ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ Heuristics for no-wait flowshops with makespan subject to mean 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 ⋮ Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments ⋮ An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

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