A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
From MaRDI portal
Publication:954034
Recommendations
- Algorithms for a realistic variant of flowshop scheduling
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- A bicriteria flowshop scheduling problem with setup times
- Scheduling flexible flow lines with sequence-dependent setup times
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
Cites work
- scientific article; zbMATH DE number 3466794 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A computational study of heuristics for two-stage flexible flowshops
- A genetic algorithm for flowshop sequencing
- A survey of scheduling problems with setup times or costs
- An Evaluation of Flow Shop Sequencing Heuristics
- Branch and bound algorithm for the flow shop with multiple processors
- Convergence of an annealing algorithm
- Future paths for integer programming and links to artificial intelligence
- Heuristics for hybrid flow shops with controllable processing times and assignable due dates
- Operations scheduling with applications in manufacturing and services. With 3.5 disk package
- Optimization by simulated annealing
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Scheduling of flexible flow lines in an automobile assembly plant
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- The flow shop with parallel machines: A tabu search approach
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(35)- scientific article; zbMATH DE number 1859345 (Why is no real title available?)
- On VNS-GRASP and iterated greedy metaheuristics for solving hybrid flow shop scheduling problem with uniform parallel machines and sequence independent setup time
- Modeling realistic hybrid flexible flowshop scheduling problems
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry
- Auxiliary resource planning in a flexible flow shop scheduling problem considering stage skipping
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- scientific article; zbMATH DE number 1975317 (Why is no real title available?)
- Heuristic approaches for scheduling jobs in large-scale flexible job shops
- Cyclic robot scheduling for 3D printer-based flexible assembly systems
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Trade-off between time complexity and makespan for flexible flow-shop group scheduling problems with two machine centers
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
- Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A systematic review of multi-objective hybrid flow shop scheduling
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Hybrid flowshop scheduling with machine and resource-dependent processing times
- Mathematical modelling and heuristic approaches to operation scheduling problems in an FMS environment
- scientific article; zbMATH DE number 1594555 (Why is no real title available?)
- Optimal parallel machine allocation problem in IC packaging using IC-PSO: an empirical study
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
- An integrated approach for scheduling health care activities in a hospital
- The hybrid flow shop scheduling problem
- Algorithms for a realistic variant of flowshop scheduling
- The third comprehensive survey on scheduling problems with setup times/costs
- A flexible job shop scheduling approach with operators for coal export terminals
- Scheduling algorithms for a semiconductor probing facility
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- Shifting representation search for hybrid flexible flowline problems
- Dynamic routing strategies for JIT production in hybrid flow shops
- Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems
This page was built for publication: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954034)
