Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
From MaRDI portal
(Redirected from Publication:1847225)
Recommendations
- Heuristics for scheduling in flowshop with multiple objectives
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- A high quality solution constructive heuristic for flow shop sequencing
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
- Flowshop sequencing with mean flowtime objective
Cites work
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
- A bicriteria approach to the two-machine flow shop scheduling problem
- A bicriteria two-machine permutation flowshop problem
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A survey and annotated bibliography of multiobjective combinatorial optimization
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- An Evaluation of Flow Shop Sequencing Heuristics
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Benchmarks for basic scheduling problems
- Flowshop sequencing with mean flowtime objective
- Heuristics for scheduling in flowshop with multiple objectives
- Multiple and bicriteria scheduling: A literature survey
- Some efficient heuristic methods for the flow shop sequencing problem
- The Complexity of Flowshop and Jobshop Scheduling
- Two-Stage Flowshop Scheduling Problem with Bicriteria
Cited in
(26)- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- 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 discrete inter-species cuckoo search for flowshop scheduling problems
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- A high quality solution constructive heuristic for flow shop sequencing
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- Trading off between makespan and customer responsiveness in flow shop sequencing
- Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A bicriteria flowshop scheduling with a learning effect
- Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Bicriteria train scheduling for high-speed passenger railroad planning applications
This page was built for publication: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847225)
