A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
From MaRDI portal
Publication:4290641
Recommendations
- Heuristic for no-wait flow shops with makespan minimization
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- New heuristics for no-wait flowshops to minimize makespan.
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- Heuristic algorithms for continuous flow-shop problem
Cited in
(52)- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- A chaotic neural network algorithm for minimizing makespan in no-wait flow shop scheduling
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- Heuristic for no-wait flow shops with makespan minimization
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- Cyclic flow-shop scheduling with no-wait constraints and missing operations
- Approximative procedures for no-wait job shop scheduling.
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- scientific article; zbMATH DE number 1910924 (Why is no real title available?)
- Concurrent flowshop scheduling to minimize makespan.
- Optimal research and numerical simulation for scheduling no-wait flow shop in steel production
- Lot sizing in a no-wait flow shop
- No-wait flowshops with bicriteria of makespan and total completion time
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- No-wait job shop scheduling: tabu search and complexity of subproblems
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Study on MDIS algorithm for the no-wait flow-shop scheduling
- Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
- On the exact solution of the no-wait flow shop problem with due date constraints
- New heuristics for flow shop problem to minimize makespan
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- The no-wait flow-shop paradox
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- Heuristic algorithms for continuous flow-shop problem
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- scientific article; zbMATH DE number 1783887 (Why is no real title available?)
- Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- New heuristics for no-wait flowshops to minimize makespan.
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- Sequencing of jobs in some production system
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- On Eulerian extensions and their application to no-wait flowshop scheduling
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- Some heuristics for no-wait flowshops with total tardiness criterion
- Scheduling two-machine no-wait open shops to minimize makespan
- Scatter search with path relinking for the job shop with time lags and setup times
- A survey of scheduling problems with no-wait in process
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- Scheduling the flowshop with zero intermediate storage using chaotic discrete artificial bee algorithm
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
This page was built for publication: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290641)