Pages that link to "Item:Q4290641"
From MaRDI portal
The following pages link to A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan (Q4290641):
Displayed 34 items.
- Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
- Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
- Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- No-wait flowshops with bicriteria of makespan and maximum lateness. (Q1410329) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- New heuristics for no-wait flowshops to minimize makespan. (Q1413816) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
- Sequencing of jobs in some production system (Q1582040) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- A survey of scheduling problems with no-wait in process (Q1751258) (← links)
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs (Q2225197) (← links)
- Heuristics for no-wait flowshops with makespan subject to mean completion time (Q2249033) (← links)
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
- A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS (Q2911576) (← links)
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem (Q5059236) (← links)
- Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm (Q5259763) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)