Heuristic algorithms for continuous flow-shop problem
From MaRDI portal
Publication:3489781
DOI<695::AID-NAV3220370508>3.0.CO;2-L 10.1002/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-LzbMath0707.90052OpenAlexW2056987382MaRDI QIDQ3489781
Chandrasekharan Rajendran, Dipak Chaudhuri
Publication date: 1990
Full work available at URL: https://doi.org/10.1002/1520-6750(199010)37:5<695::aid-nav3220370508>3.0.co;2-l
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (22)
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 ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ Total flowtime in no-wait flowshops with separated setup times. ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ New heuristics for no-wait flowshops to minimize makespan. ⋮ Some effective heuristics for no-wait flowshops with setup times to minimize total completion time ⋮ 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 ⋮ The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Minimizing total completion time in two-machine flow shops with exact delays ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Stochastically minimizing total flowtime in flowshops with no waiting space ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
This page was built for publication: Heuristic algorithms for continuous flow-shop problem
