Pages that link to "Item:Q1854757"
From MaRDI portal
The following pages link to Lower bounds for scheduling a single robot in a job-shop environment (Q1854757):
Displaying 9 items.
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
- Approximation algorithms for the twin robot scheduling problem (Q2305018) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- Solving a vehicle routing problem with resource conflicts and makespan objective with an application in car body manufacturing (Q5746704) (← links)
- Makespan minimization for flow-shop problems with transportation times and a single robot (Q5946823) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
