Pages that link to "Item:Q2572844"
From MaRDI portal
The following pages link to Flowshop scheduling research after five decades (Q2572844):
Displaying 45 items.
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- Carbon-efficient scheduling of flow shops by multi-objective optimization (Q320773) (← links)
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- Effect of solution representations on tabu search in scheduling applications (Q336636) (← links)
- A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
- Flow shop batching and scheduling with sequence-dependent setup times (Q490328) (← links)
- An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
- A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem (Q730912) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (Q870153) (← links)
- A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines (Q892903) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- Three-machine flow shop scheduling with overlapping waiting time constraints (Q1628045) (← links)
- Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← links)
- Truck synchronization at single door cross-docking terminals (Q1656428) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- Classifying and modeling setups and cleanings in lot sizing and scheduling (Q1753633) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation (Q2003426) (← links)
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages (Q2356251) (← links)
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) (← links)
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times (Q3055422) (← links)
- A discrete time reactive scheduling model for new order insertion in job shop, make-to-order industries (Q3168937) (← links)
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES (Q3406723) (← links)
- Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup (Q3621499) (← links)
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem (Q6065188) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates (Q6094571) (← links)
