Flowshop-scheduling problems with makespan criterion: a review

DOI10.1080/0020754050056417zbMath1068.90059OpenAlexW2001664299MaRDI QIDQ5466734

No author found.

Publication date: 25 August 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020754050056417

zbMATH Keywords

heuristicsdynamic programmingmetaheuristicssimulated annealingtabu searchmakespangenetic algorithmflowshopant colony optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (59)

A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ Scheduling semiconductor in-line steppers in new product/process introduction scenarios ⋮ Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ Makespan distribution of permutation flowshop schedules ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ New hard benchmark for flowshop scheduling problems minimising makespan ⋮ 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 ⋮ 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 ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ 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 ⋮ 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 ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems ⋮ A branch-and-cut approach for the distributed no-wait flowshop scheduling problem ⋮ 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 ⋮ Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ Two-machine flow shop scheduling problem with an outsourcing option ⋮ A note on makespan minimization in proportionate flow shops ⋮ A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems ⋮ 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 ⋮ A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ 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 ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ 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 ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation ⋮ Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup ⋮ Planning and scheduling of the make-and-pack dairy production under lifetime uncertainty ⋮ Minimizing makespan for a no-wait flowshop using genetic algorithm ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ The distributed permutation flowshop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Scheduling batches on parallel machines with major and minor set-ups
• The two-machine sequence dependent flowshop scheduling problem
• A new heuristic method for the flow shop sequencing problem
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Modified simulated annealing algorithms for the flow shop sequencing problem
• Multiple and bicriteria scheduling: A literature survey
• An adaptive branching rule for the permutation flow-shop problem
• A fast tabu search algorithm for the permutation flow-shop problem
• Genetic algorithms for the two-stage bicriteria flowshop problem
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
• A new constructive heuristic for the flowshop scheduling problem
• A tabu search approach for the flow shop scheduling problem
• Two-machine group scheduling problem with blocking and anticipatory setups
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• A genetic algorithm for flowshop sequencing
• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• Two-stage no-wait scheduling models with setup and removal times separated
• Heuristics for scheduling in flowshop with multiple objectives
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Total flowtime in no-wait flowshops with separated setup times.
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• New heuristics for no-wait flowshops to minimize makespan.
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Concurrent flowshop scheduling to minimize makespan.
• An ant colony system for permutation flow-shop sequencing
• Efficiency of reductions of job-shop to flow-shop problems
• Local search algorithms for the multiprocessor flow shop scheduling problem
• The permutation flow shop with buffers: A tabu search approach
• A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• A comprehensive review and evaluation of permutation flowshop heuristics
• Heuristics for permutation flow shop scheduling with batch setup times
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Two models for a family of flowshop sequencing problems
• Makespan estimation in batch process industries: A comparison between regression analysis and neural networks
• Two-machine flowshop scheduling with a secondary criterion
• Average cost optimal policy for a stochastic two-machine flowshop with limited work-in-process.
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A neuro-tabu search heuristic for the flow shop scheduling problem
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• A new heuristic for the n-job, M-machine flow-shop problem
• Benchmarks for basic scheduling problems
• Group technology in a hybrid flowshop environment: a case study
• Two MILP models for the N × M SDST flowshop sequencing problem
• Multicriteria scheduling problems: a survey
• Optimal two- and three-stage production schedules with setup times included
• Flowshop sequencing problems with limited buffer storage
• Flow Shop Problems with Time Lags
• Sequency on two and three machines with setup, processing and removal times separated
• Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions
• The flow shop problem with time lags and separated setup times
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Flowshop scheduling with limited temporary storage
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
• A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems
• Solutions to the Constrained Flowshop Sequencing Problem
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• An Evaluation of Flow Shop Sequencing Heuristics
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
• Minimizing Cycle Time in a Blocking Flowshop
• New block properties for the permutation flow shop problem with application in tabu search
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Sequencing n jobs on two machines with setup, processing and removal times separated
• A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
• Defining tabu list size and aspiration criterion within tabu search methods

This page was built for publication: Flowshop-scheduling problems with makespan criterion: a review