Pages that link to "Item:Q5946823"
From MaRDI portal
The following pages link to Makespan minimization for flow-shop problems with transportation times and a single robot (Q5946823):
Displayed 29 items.
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots (Q336565) (← links)
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
- Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- Flowshop scheduling with interstage job transportation (Q892841) (← links)
- A two-stage flow shop scheduling problem with transportation considerations (Q904289) (← links)
- Optimization of processing and delivery decisions involving third-party machines (Q1000038) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence (Q1702665) (← links)
- Robotic cell scheduling with operational flexibility (Q1765510) (← links)
- Machine scheduling with job delivery coordination (Q1876146) (← links)
- Coordinating multi-location production and customer delivery (Q1936790) (← links)
- Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
- Coordination of production and transportation in supply chain scheduling (Q2514664) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- New complexity results on scheduling problem in a robotic cell (Q4603936) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
- Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen (Q6068710) (← links)
- Flow shop scheduling problems with transportation constraints revisited (Q6168926) (← links)
- Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
- An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)