Pages that link to "Item:Q5590535"
From MaRDI portal
The following pages link to A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem (Q5590535):
Displayed 50 items.
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem (Q581221) (← 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 taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- A new approach to two-machine flow shop problem with uncertain processing times (Q862510) (← 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)
- Sequence optimization and design of allocation using GA and SA (Q884646) (← links)
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions (Q1011174) (← links)
- A genetic algorithm for flowshop scheduling with multiple objectives (Q1018947) (← 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)
- A new integer programming formulation for the permutation flowshop problem (Q1121163) (← links)
- Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions (Q1121756) (← links)
- Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778) (← links)
- Optimal fuzzy counterparts of scheduling rules (Q1124817) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← 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)
- Fuzzy job sequencing for a flow shop (Q1205686) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Scheduling arrivals to a production system in a fuzzy environment (Q1268199) (← 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 two-machine permutation flow shop scheduling problem with buffers (Q1286775) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan (Q1296660) (← 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)
- Two-machine group scheduling problem with blocking and anticipatory setups (Q1309970) (← 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)