Flowshop-scheduling problems with makespan criterion: a review (Q5466734)

scientific article; zbMATH DE number 2198742

Language	Label	Description	Also known as
English	Flowshop-scheduling problems with makespan criterion: a review	scientific article; zbMATH DE number 2198742

Statements

instance of

scholarly article

0 references

title

Flowshop-scheduling problems with makespan criterion: a review (English)

0 references

zbMATH Open document ID

1068.90059

0 references

DOI

10.1080/0020754050056417

0 references

published in

International Journal of Production Research

0 references

publication date

25 August 2005

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

flowshop

0 references

makespan

0 references

dynamic programming

0 references

heuristics

0 references

metaheuristics

0 references

simulated annealing

0 references

genetic algorithm

0 references

tabu search

0 references

ant colony optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/0020754050056417

0 references

OpenAlex ID

W2001664299

0 references

cites work

Minimizing Cycle Time in a Blocking Flowshop

0 references

New heuristics for no-wait flowshops to minimize makespan.

0 references

Total flowtime in no-wait flowshops with separated setup times.

0 references

A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

0 references

Scheduling in stochastic flowshops with independent setup, processing and removal times

0 references

Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications

0 references

No-wait flowshops with bicriteria of makespan and maximum lateness.

0 references

Group technology in a hybrid flowshop environment: a case study

0 references

A tabu search approach for the flow shop scheduling problem

0 references

Solutions to the Constrained Flowshop Sequencing Problem

0 references

A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

0 references

Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

0 references

Q3970631

0 references

An Evaluation of Flow Shop Sequencing Heuristics

0 references

Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines

0 references

A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

0 references

Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem

0 references

New block properties for the permutation flow shop problem with application in tabu search

0 references

A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Efficiency of reductions of job-shop to flow-shop problems

0 references

A Functional Heuristic Algorithm for the Flowshop Scheduling Problem

0 references

The two-machine sequence dependent flowshop scheduling problem

0 references

Two-stage no-wait scheduling models with setup and removal times separated

0 references

Scheduling a two-stage hybrid flowshop with separable setup and removal times

0 references

A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

0 references

A new heuristic for the n-job, M-machine flow-shop problem

0 references

Modified simulated annealing algorithms for the flow shop sequencing problem

0 references

Improved genetic algorithm for the permutation flowshop scheduling problem.

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions

0 references

Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness

0 references

Optimization by Simulated Annealing

0 references

A new constructive heuristic for the flowshop scheduling problem

0 references

Concurrent flowshop scheduling to minimize makespan.

0 references

Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem

0 references

Flowshop sequencing problems with limited buffer storage

0 references

A hybrid two-stage flowshop with part family, batch production, major and minor set-ups

0 references

Two-machine group scheduling problem with blocking and anticipatory setups

0 references

A New Heuristic Method for the Permutation Flow Shop Scheduling Problem

0 references

Multiple and bicriteria scheduling: A literature survey

0 references

A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem

0 references

Local search algorithms for the multiprocessor flow shop scheduling problem

0 references

Genetic algorithms for the two-stage bicriteria flowshop problem

0 references

The permutation flow shop with buffers: A tabu search approach

0 references

A fast tabu search algorithm for the permutation flow-shop problem

0 references

The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem

0 references

Flowshop scheduling with limited temporary storage

0 references

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

0 references

An adaptive branching rule for the permutation flow-shop problem

0 references

Average cost optimal policy for a stochastic two-machine flowshop with limited work-in-process.

0 references

Makespan estimation in batch process industries: A comparison between regression analysis and neural networks

0 references

A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria

0 references

Heuristics for scheduling in flowshop with multiple objectives

0 references

Two-Stage Flowshop Scheduling Problem with Bicriteria

0 references

Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.

0 references

On the Flow-Shop Sequencing Problem with No Wait in Process†

0 references

A genetic algorithm for flowshop sequencing

0 references

Improving the Efficiency of Tabu Search for Machine Sequencing Problems

0 references

Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.

0 references

The Three-Machine No-Wait Flow Shop is NP-Complete

0 references

A comprehensive review and evaluation of permutation flowshop heuristics

0 references

Defining tabu list size and aspiration criterion within tabu search methods

0 references

A neuro-tabu search heuristic for the flow shop scheduling problem

0 references

Heuristics for permutation flow shop scheduling with batch setup times

0 references

Two models for a family of flowshop sequencing problems

0 references

Sequencing n jobs on two machines with setup, processing and removal times separated

0 references

Sequency on two and three machines with setup, processing and removal times separated

0 references

Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

0 references

Flow Shop Problems with Time Lags

0 references

The flow shop problem with time lags and separated setup times

0 references

Q3806968

0 references

Multicriteria scheduling problems: a survey

0 references

Two-machine flowshop scheduling with a secondary criterion

0 references

An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

0 references

Benchmarks for basic scheduling problems

0 references

Some efficient heuristic methods for the flow shop sequencing problem

0 references

Scheduling batches on parallel machines with major and minor set-ups

0 references

Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution

0 references

Two MILP models for the N × M SDST flowshop sequencing problem

0 references

A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems

0 references

Q3479795

0 references

A new heuristic method for the flow shop sequencing problem

0 references

Solution of the Flowshop-Scheduling Problem with No Intermediate Queues

0 references

An ant colony system for permutation flow-shop sequencing

0 references

Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5466734