Flowshop-scheduling problems with makespan criterion: a review
From MaRDI portal
Recommendations
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Scheduling a two-stage flowshop under makespan constraint
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- New hard benchmark for flowshop scheduling problems minimising makespan
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
- A review of TSP based approaches for flowshop scheduling
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- scientific article; zbMATH DE number 1437089
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
Cites work
- A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A fast tabu search algorithm for the permutation flow-shop problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A genetic algorithm for flowshop sequencing
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- A neuro-tabu search heuristic for the flow shop scheduling problem
- A new constructive heuristic for the flowshop scheduling problem
- A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- A new heuristic for the n-job, M-machine flow-shop problem
- A new heuristic method for the flow shop sequencing problem
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A tabu search approach for the flow shop scheduling problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An adaptive branching rule for the permutation flow-shop problem
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- An ant colony system for permutation flow-shop sequencing
- An Evaluation of Flow Shop Sequencing Heuristics
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Average cost optimal policy for a stochastic two-machine flowshop with limited work-in-process.
- Benchmarks for basic scheduling problems
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Concurrent flowshop scheduling to minimize makespan.
- Defining tabu list size and aspiration criterion within tabu search methods
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Efficiency of reductions of job-shop to flow-shop problems
- Flow Shop Problems with Time Lags
- Flowshop scheduling with limited temporary storage
- Flowshop sequencing problems with limited buffer storage
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Group technology in a hybrid flowshop environment: a case study
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Heuristics for permutation flow shop scheduling with batch setup times
- Heuristics for scheduling in flowshop with multiple objectives
- scientific article; zbMATH DE number 4149877 (Why is no real title available?)
- scientific article; zbMATH DE number 4074791 (Why is no real title available?)
- scientific article; zbMATH DE number 7722 (Why is no real title available?)
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
- Minimizing Cycle Time in a Blocking Flowshop
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Multicriteria scheduling problems: a survey
- Multiple and bicriteria scheduling: A literature survey
- New block properties for the permutation flow shop problem with application in tabu search
- New heuristics for no-wait flowshops to minimize makespan.
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization by simulated annealing
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling batches on parallel machines with major and minor set-ups
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Scheduling in stochastic flowshops with independent setup, processing and removal times
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Sequency on two and three machines with setup, processing and removal times separated
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- Solutions to the Constrained Flowshop Sequencing Problem
- Some efficient heuristic methods for the flow shop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- The flow shop problem with time lags and separated setup times
- The permutation flow shop with buffers: A tabu search approach
- The Three-Machine No-Wait Flow Shop is NP-Complete
- The two-machine sequence dependent flowshop scheduling problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Total flowtime in no-wait flowshops with separated setup times.
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- Two MILP models for the N × M SDST flowshop sequencing problem
- Two models for a family of flowshop sequencing problems
- Two-machine flowshop scheduling with a secondary criterion
- Two-machine group scheduling problem with blocking and anticipatory setups
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Two-stage no-wait scheduling models with setup and removal times separated
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
Cited in
(70)- An empirical analysis of the optimality rate of flow shop heuristics
- The distributed permutation flowshop scheduling problem
- Concurrent flowshop scheduling to minimize makespan.
- Three-machine flow shop scheduling with overlapping waiting time constraints
- A comprehensive review of flowshop group scheduling literature
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
- A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Classifying and modeling setups and cleanings in lot sizing and scheduling
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
- A note on makespan minimization in proportionate flow shops
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- Iterative beam search algorithms for the permutation flowshop
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty
- The evolution of schematic representations of flow shop scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Flowshop scheduling research after five decades
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- Accelerating the calculation of makespan used in scheduling improvement heuristics
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
- A research survey: review of flexible job shop scheduling techniques
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly
- New hard benchmark for flowshop scheduling problems minimising makespan
- Review of the ordered and proportionate flow shop scheduling research
- A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling
- Scheduling semiconductor in-line steppers in new product/process introduction scenarios
- On heuristic solutions for the stochastic flowshop scheduling problem
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Effect of solution representations on tabu search in scheduling applications
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A generalized constructive algorithm using insertion-based heuristics
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup
- scientific article; zbMATH DE number 3916005 (Why is no real title available?)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times
- Two-machine flow shop scheduling problem with an outsourcing option
- scientific article; zbMATH DE number 522730 (Why is no real title available?)
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty
- Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
- A review and classification on distributed permutation flowshop scheduling problems
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Makespan distribution of permutation flowshop schedules
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
- Flow shops with machine maintenance: ordered and proportionate cases
This page was built for publication: Flowshop-scheduling problems with makespan criterion: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466734)
