Complexity results for flow-shop and open-shop scheduling problems with transportation delays
From MaRDI portal
(Redirected from Publication:596453)
Recommendations
- Complexity of flow shop scheduling problems with transportation constraints
- A note on the complexity of flow shop scheduling with transportation constraints
- Flow shop scheduling problems with transportation constraints revisited
- On the complexity of open shop scheduling with time lags
- scientific article; zbMATH DE number 4108473
- Complexity results for flow-shop scheduling problems with transportation delays and a single robot
- scientific article; zbMATH DE number 5665941
- A Note On The Complexity Of Openshop Scheduling Problems
- Routing open shop and flow shop scheduling problems
- scientific article; zbMATH DE number 6747350
Cited in
(28)- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- A note on the complexity of flow shop scheduling with transportation constraints
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Scheduling in manufacturing with transportation: classification and solution techniques
- scientific article; zbMATH DE number 5665941 (Why is no real title available?)
- scientific article; zbMATH DE number 4108473 (Why is no real title available?)
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- Complexity of flow shop scheduling problems with transportation constraints
- Polynomial-time approximation schemes for scheduling problems with time lags
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Irreducible bin packing and normality in routing open shop
- Scheduling parallel batching machines in a sequence
- On the complexity of open shop scheduling with time lags
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Transporting jobs through a two‐machine open shop
- Preemptive scheduling on two identical parallel machines with a single transporter
- On a routing open shop problem on two nodes with unit processing times
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Complexity results for flow-shop scheduling problems with transportation delays and a single robot
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Vyacheslav Tanaev: contributions to scheduling and related areas
This page was built for publication: Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596453)
