Some efficient heuristic methods for the flow shop sequencing problem
From MaRDI portal
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Distributed algorithms (68W15)
Recommendations
- A new heuristic method for the flow shop sequencing problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A high quality solution constructive heuristic for flow shop sequencing
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A heuristic search algorithm for flow-shop scheduling
- A fast method for heuristics in large-scale flow shop scheduling
- A Note on Heuristics of Flow-Shop Scheduling
- Heuristic algorithms for continuous flow-shop problem
- A heuristic algorithm for Flow Shop problem in batch processing
- A new constructive heuristic for the flowshop scheduling problem
Cites work
Cited in
(only showing first 100 items - show all)- Scheduling production tasks in a two-stage FMS
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
- A user's guide to tabu search
- Heuristic procedures for minimizing makespan and the number of required pallets
- Search heuristics for operation sequencing in process planning
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Logic-based benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
- Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations
- Transportation and delivery in flow-shop scheduling problems: a systematic review
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
- The distributed flow shop scheduling problem with inter-factory transportation
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- Fifty years of metaheuristics
- The generalized shifting bottleneck procedure
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Flow shop scheduling problem with conflict graphs
- Combinatorial optimization techniques for spacecraft scheduling automation
- Makespan distribution of permutation flowshop schedules
- A new heuristic method for the flow shop sequencing problem
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
- Two-stage hybrid flow shop with recirculation
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- A parallel ``Go with the winners algorithm for some scheduling problems
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- Hierarchical minimization of completion time variance and makespan in jobshops
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Sequencing CONWIP flow-shops: Analysis and heuristics
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- Evaluating parallel simulated evolution strategies for VLSI cell placement
- Parallel hybrid heuristics for the permutation flow shop problem
- Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II
- Evaluating the performance of tabu search procedures for flow shop sequencing
- A comparison of local search methods for flow shop scheduling
- Performance enhancements to tabu search for the early/tardy scheduling problem
- Parallel local search
- Flowshop-scheduling problems with makespan criterion: a review
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- Two-machine flow shop problems with a single server
- A genetic algorithm for flowshop sequencing
- Scheduling flow shops using differential evolution algorithm
- Job-shop production scheduling with reverse flows
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- A fast local search for the identical parallel machine scheduling problem with the position-based deteriorating effect and maintenance
- An improved NEH-based heuristic for the permutation flowshop problem
- The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
- An effective heuristic algorithm for the partial shop scheduling problem
- Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
- A high quality solution constructive heuristic for flow shop sequencing
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Sequencing of jobs in some production system
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- A matheuristic approach for the two-machine total completion time flow shop problem
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- The distributed permutation flowshop scheduling problem
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
- Carbon-efficient scheduling of flow shops by multi-objective optimization
- Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
- Flow-shop scheduling with flexible processors
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- A neuro-tabu search heuristic for the flow shop scheduling problem
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
This page was built for publication: Some efficient heuristic methods for the flow shop sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915635)
