scientific article; zbMATH DE number 3689114
From MaRDI portal
Publication:3883869
Cited in
(27)- Two-machine flowshop group scheduling problem
- Machine scheduling with job delivery coordination
- On a scheduling problem in a robotized analytical system
- Coordinating multi-location production and customer delivery
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Realistic two-stage flowshop batch scheduling problems with transportation capacity and times
- A two-machine flowshop scheduling problem with a separated maintenance constraint
- Single machine scheduling with release dates and job delivery to minimize the makespan
- Analysis of heuristics for the UET two-machine flow shop problem with time delays
- An improved two-machine flowshop scheduling with intermediate transportation
- Transporting jobs through a two‐machine open shop
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- UET flow shop scheduling with delays
- Hybrid flowshop scheduling with interstage job transportation
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Flow shop scheduling problems with transportation constraints revisited
- Flow shop scheduling problems with transportation constraints revisited
- An improved approximation algorithm for single machine scheduling with job delivery
- Scheduling in manufacturing with transportation: classification and solution techniques
- Decomposition heuristics for the hybrid flexible flowshop with transportation times
- Machine scheduling with deliveries to multiple customer locations
- An exact decomposition-based approach to the conflict-free-transportation-constrained flexible job-shop scheduling problem
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Flowshop scheduling with interstage job transportation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883869)
