Complexity results for flow-shop and open-shop scheduling problems with transportation delays

Cited In (26)

Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
Some results of the worst-case analysis for flow shop scheduling with a learning effect
A note on the complexity of flow shop scheduling with transportation constraints
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
Scheduling in manufacturing with transportation: classification and solution techniques
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
Title not available (Why is that?)
Title not available (Why is that?)
On a routing Open Shop Problem on two nodes with unit processing times
Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
Polynomial-time approximation schemes for scheduling problems with time lags
Irreducible bin packing and normality in routing open shop
On the complexity of open shop scheduling with time lags
Scheduling parallel batching machines in a sequence
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
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
Permutation flowshop scheduling problems with maximal and minimal time lags
Minimizing the weighted number of tardy jobs on multiple machines: a review
Vyacheslav Tanaev: contributions to scheduling and related areas
Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing

Recommendations

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)