The Lessons of Flowshop Scheduling Research
From MaRDI portal
Cited in
(44)- A worst-case analysis of the three-machine flow shop scheduling
- Architecture of manufacturing scheduling systems: literature review and an integrated proposal
- An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- A review of TSP based approaches for flowshop scheduling
- Variants of the two machine flow shop problem connected with factorization of matrix functions
- A new lower bounding rule for permutation flow shop scheduling
- A modification to the CGPS algorithm for three-machine flow shop scheduling
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
- Comparison of iterative improvement techniques for schedule optimization
- Real-time routing in flexible flow shops: a self-adaptive swarm-based control model
- New hard benchmark for flowshop scheduling problems minimising makespan
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- Modeling realistic hybrid flexible flowshop scheduling problems
- Frameworks for adaptable scheduling algorithms
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
- A flow shop scheduling problem with machine-dependent speeds: an ensemble approach with worst-case analysis
- Algorithms for a realistic variant of flowshop scheduling
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach
- The evolution of schematic representations of flow shop scheduling problems
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
- A comprehensive review and evaluation of permutation flowshop heuristics
- The job shop scheduling problem: Conventional and new solution techniques
- Machine scheduling models in environmentally focused chemical manufacturing
- A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
- Experimental comparison of heuristics for flow shop scheduling
- Two-machine flowshop scheduling with availability constraints
- Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Looking ahead with the pilot method
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
- Minimizing total tardiness in permutation flowshops
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- Flowshop scheduling research after five decades
- Heuristics for permutation flow shop scheduling with batch setup times
- Multiple and bicriteria scheduling: A literature survey
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
This page was built for publication: The Lessons of Flowshop Scheduling Research
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991317)
