Pages that link to "Item:Q5331678"
From MaRDI portal
The following pages link to Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem (Q5331678):
Displayed 50 items.
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Performance of scheduling algorithms for no-wait flowshops with parallel machines (Q1310022) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- Optimal control of a class of DEDS: Flow-shops with state-dependent processing times (Q1314858) (← links)
- Some complexity results in cyclic scheduling (Q1341404) (← links)
- A variant of the permutation flow shop model with variable processing times (Q1363747) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. (Q1410120) (← links)
- On Gilmore-Gomory's open question for the bottleneck TSP. (Q1412716) (← links)
- Approximability of two-machine no-wait flowshop scheduling with availability constraints. (Q1413925) (← links)
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. (Q1420383) (← links)
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups (Q1577472) (← links)
- Sequencing of jobs in some production system (Q1582040) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint (Q1607139) (← links)
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking (Q1615967) (← links)
- Two-stage hybrid flowshop scheduling with simultaneous processing machines (Q1617273) (← links)
- Scheduling electric vehicles and locating charging stations on a path (Q1617297) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- Three-machine flow shop scheduling with overlapping waiting time constraints (Q1628045) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards (Q1656422) (← links)
- Applications of max-plus algebra to flow shop scheduling problems (Q1671348) (← links)
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
- Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← links)
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times (Q1751897) (← links)
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines (Q1767900) (← links)
- Two-machine flow shop scheduling problems with no-wait jobs (Q1779704) (← links)
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds (Q1804883) (← links)
- Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008) (← links)
- An equivalency problem in discrete programming over ordered semigroups (Q1843494) (← links)
- Complexity of flow shop scheduling problems with transportation constraints (Q1887768) (← links)
- Lot sizing in a no-wait flow shop (Q1904756) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- The forgotten sons: warehousing systems for brick-and-mortar retail chains (Q2028872) (← links)
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
- A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- Twin-crane scheduling during seaside workload peaks with a dedicated handshake area (Q2124909) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine (Q2158014) (← links)
- Approximating the 2-machine flow shop problem with exact delays taking two values (Q2174271) (← links)
- Interference aware scheduling of triple-crossover-cranes (Q2197327) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)