Pages that link to "Item:Q4147827"
From MaRDI portal
The following pages link to An Evaluation of Flow Shop Sequencing Heuristics (Q4147827):
Displaying 50 items.
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← links)
- Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
- New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
- Some efficient heuristic methods for the flow shop sequencing problem (Q915635) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Production scheduling with applications in the printing industry (Q1062606) (← links)
- A new heuristic method for the flow shop sequencing problem (Q1119464) (← links)
- Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
- Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling (Q1183390) (← links)
- An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720) (← links)
- Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs (Q1280126) (← links)
- Heuristic for scheduling in a Kanban system with dual blocking mechanisms (Q1280177) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- A tabu search approach for the flow shop scheduling problem (Q1296693) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770) (← links)
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment (Q1319566) (← links)
- A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
- A heuristic algorithm for mean flowtime objective in flowshop scheduling (Q1389189) (← links)
- Total flowtime in no-wait flowshops with separated setup times. (Q1406685) (← links)
- A contribution to the stochastic flow shop scheduling problem. (Q1410626) (← links)
