A note on the complexity of flow shop scheduling with transportation constraints
From MaRDI portal
Publication:859706
DOI10.1016/j.ejor.2005.08.034zbMath1163.90517OpenAlexW2095073947MaRDI QIDQ859706
Youjun Chen, Jinjiang Yuan, Ameur Soukhal, Ling-Fa Lu
Publication date: 16 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.08.034
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (12)
Synchronizing production and air transportation scheduling using mathematical programming models ⋮ Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ A Genetic Algorithm for the Integrated Scheduling of Production and Transport Systems ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Transporting jobs through a two‐machine open shop ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
Cites Work
- Unnamed Item
- Complexity of flow shop scheduling problems with transportation constraints
- Batching and Scheduling Jobs on Batch and Discrete Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Machine scheduling with transportation considerations
- Scheduling batches with simultaneous job processing for two-machine shop problems
This page was built for publication: A note on the complexity of flow shop scheduling with transportation constraints
