A new heuristic for the n-job, M-machine flow-shop problem
From MaRDI portal
Publication:2277356
Recommendations
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- A high quality solution constructive heuristic for flow shop sequencing
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A new heuristic method for the flow shop sequencing problem
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3485481 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
- Optimal two- and three-stage production schedules with set-up time included
- Solutions to the Constrained Flowshop Sequencing Problem
Cited in
(50)- A flexible flowshop problem with total flow time minimization
- A heuristic search algorithm for flow-shop scheduling
- Heuristic procedures for minimizing makespan and the number of required pallets
- Flow shops with WIP and value added costs
- A new heuristic method for the flow shop sequencing problem
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Solving multi-objective production scheduling problems using metaheuristics
- Flowshop-scheduling problems with makespan criterion: a review
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Scheduling flow shops using differential evolution algorithm
- A discrete inter-species cuckoo search for flowshop scheduling problems
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- A high quality solution constructive heuristic for flow shop sequencing
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- New heuristics for flow shop problem to minimize makespan
- A neuro-tabu search heuristic for the flow shop scheduling problem
- A fast tabu search algorithm for the permutation flow-shop problem
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- The job shop scheduling problem: Conventional and new solution techniques
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- A bicriteria flowshop scheduling with a learning effect
- Flowshop sequencing with mean flowtime objective
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A tabu search approach for the flow shop scheduling problem
- Some results of the worst-case analysis for flow shop scheduling
- Forward backward transformation
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Heuristics for scheduling in flowshop with multiple objectives
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
- scientific article; zbMATH DE number 1982190 (Why is no real title available?)
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- Some aspects of scatter search in the flow-shop problem
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry
- A new constructive heuristic for the flowshop scheduling problem
- Heuristics for scheduling in a flow shop with multiple processors
- Heuristics for permutation flow shop scheduling with batch setup times
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
This page was built for publication: A new heuristic for the n-job, M-machine flow-shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277356)
