Transporting jobs through a two‐machine open shop
From MaRDI portal
Publication:3621908
DOI10.1002/nav.20323zbMath1158.90315OpenAlexW2161384986MaRDI QIDQ3621908
Irina N. Lushchakova, Alan J. Soper, Vitaly A. Strusevich
Publication date: 22 April 2009
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20323
Related Items (9)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ On a routing Open Shop Problem on two nodes with unit processing times ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs ⋮ Preemptive scheduling on two identical parallel machines with a single transporter ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- A note on the complexity of flow shop scheduling with transportation constraints
- Approximability of flow shop scheduling
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Complexity of one-cycle robotic flow-shops
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- Complexity of flow shop scheduling problems with transportation constraints
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined
- The routing open-shop problem on a network: complexity and approximation
- Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
- Two-machine open shop scheduling with special transportation times
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot
- Open shop scheduling with delays
- Open Shop Scheduling to Minimize Finish Time
- Routing Two-Machine Flowshop Problems on Networks with Special Structure
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
- Dominance of Cyclic Solutions and Challenges in the Scheduling of Robotic Cells
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: Transporting jobs through a two‐machine open shop
