Heuristic algorithms for continuous flow-shop problem

DOI10.1002/1520-6750(199010)37:5%3C695::AID-NAV3220370508%3E3.0.CO;2-LMaRDI QIDQ3489781zbMATH OpenOpenAlexFDO

Authors Chandrasekharan Rajendran, Dipak Chaudhuri

Publication date 1990

Full work available at URL https://doi.org/10.1002/1520-6750(199010)37:5%3C695::aid-nav3220370508%3E3.0.co;2-l

zbMATH Keywords

continuous flow shopheuristic algorithmstotal flow time of jobs

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An efficient heuristic approach to the scheduling of jobs in a flowshop
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Heuristic approaches for n/m/F/ C_i scheduling problems
• A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
• Solving the continuous flow-shop scheduling problem by metaheuristics.

Cited in

(27)

• 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
• 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.
• Stochastically minimizing total flowtime in flowshops with no waiting space
• Heuristics for scheduling in a flow shop with multiple processors
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• 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
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• A hybrid harmony search algorithm for the 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
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• A heuristic search algorithm for flow-shop scheduling
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• scientific article; zbMATH DE number 1783887 (Why is no real title available?)
• Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
• Fitness landscape analysis for the no-wait flow-shop scheduling problem
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• A new heuristic and dominance relations for no-wait flowshops with setups
• An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
• Minimizing makespan for a no-wait flowshop using genetic algorithm
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times
• Some efficient heuristic methods for the flow shop sequencing problem
• Heuristic algorithms for two machine re-entrant flow shop

This page was built for publication: Heuristic algorithms for continuous flow-shop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489781)