Pages that link to "Item:Q1296581"
From MaRDI portal
The following pages link to A heuristic for the two-machine open-shop scheduling problem with transportation times (Q1296581):
Displaying 24 items.
- Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) (← links)
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528) (← links)
- Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm (Q2284476) (← links)
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- On-line two-machine open shop scheduling with time lags (Q2654315) (← links)
- (Q3033546) (← links)
- Two-machine open shop scheduling with special transportation times (Q3157382) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- (Q3832310) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) (← links)
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays (Q5443372) (← links)
- On the complexity of open shop scheduling with time lags (Q6173710) (← links)
- Reentrant open shop scheduling problem with time lags and no-wait constraints (Q6568390) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
