Pages that link to "Item:Q5331678"

The following pages link to Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem (Q5331678):

Displaying 50 items.

• The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
• Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
• Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times (Q342351) (← links)
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
• Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
• Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
• Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
• Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
• On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
• Exact methods for the robotic cell problem (Q656059) (← links)
• Batch scheduling in a two-machine flow shop with limited buffer (Q674441) (← links)
• Monge and feasibility sequences in general flow problems (Q686244) (← links)
• Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
• Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
• Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
• Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
• Complexity results for flow shop problems with synchronous movement (Q726218) (← links)
• Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← 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)
• On no-wait and no-idle flow shops with makespan criterion (Q859679) (← links)
• A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
• Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
• Sequencing and scheduling in robotic cells: recent developments (Q880509) (← links)
• Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
• An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
• Throughput optimization in two-machine flowshops with flexible operations (Q983633) (← links)
• An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
• The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints (Q1029003) (← links)
• An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
• Recognition of Gilmore-Gomory traveling salesman problem (Q1080781) (← links)
• Greedy concepts for network flow problems (Q1088884) (← links)
• An algorithm for the detection and construction of Monge sequences (Q1116656) (← links)
• Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
• Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets (Q1166415) (← links)
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• The two-machine total completion time flow shop problem (Q1266536) (← links)
• Cyclic scheduling in 3-machine robotic flow shops (Q1283916) (← links)
• Minimizing makespan in a pallet-constrained flowshop (Q1295835) (← links)
• Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942) (← links)
• Two-machine group scheduling problem with blocking and anticipatory setups (Q1309970) (← links)
• Dynamic sequencing of robot moves in a manufactoring cell (Q1309972) (← links)