Solving the continuous flow-shop scheduling problem by metaheuristics.
From MaRDI portal
Publication:1410624
DOI10.1016/S0377-2217(02)00834-2zbMath1052.90030MaRDI QIDQ1410624
Publication date: 14 October 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
HeuristicsTabu searchSimulated annealingMetaheuristicsContinuous flow-shop schedulingTime-dependent traveling salesman problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems ⋮ Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ An efficient binary gradient-based optimizer for feature selection ⋮ A survey of scheduling problems with no-wait in process ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ 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 ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Minimizing total completion time in two-machine flow shops with exact delays ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays ⋮ Looking ahead with the pilot method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Applications of modern heuristic search methods to pattern sequencing problems
- Complexity, algorithms, programs, systems: The shifting focus
- A classification of formulations for the (time-dependent) traveling salesman problem
- Designing and reporting on computational experiments with heuristic methods
- Testing heuristics: We have it all wrong
- Benchmarks for basic scheduling problems
- Hashing vectors for tabu search
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- A note on the flow-shop problem without interruptions in job processing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Heuristic algorithms for continuous flow-shop problem
- Convergence of an annealing algorithm
- Cooling Schedules for Optimal Annealing
- Flowshop scheduling with limited temporary storage
- Solvable Cases of the No-wait Flow-shop Scheduling Problem
- The Lessons of Flowshop Scheduling Research
- General Purpose Simulated Annealing
- Optimal flowshop schedules with no intermediate storage space
- Solutions to the Constrained Flowshop Sequencing Problem
- P-Complete Approximation Problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Delivery Man Problem and Cumulative Matroids
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Needed: An Empirical Science of Algorithms
- Time‐dependent traveling salesman problem–the deliveryman case
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- The traveling salesman problem with cumulative costs
- 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
