A heuristic for the two-machine open-shop scheduling problem with transportation times
From MaRDI portal
Publication:1296581
DOI10.1016/S0166-218X(99)00115-8zbMATH Open0941.90037OpenAlexW1987867541MaRDI QIDQ1296581FDOQ1296581
Authors: V. A. Strusevich 
Publication date: 7 August 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00115-8
Recommendations
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Open Shop Scheduling to Minimize Finish Time
- Short Shop Schedules
- Open shop scheduling with delays
- Shop Problems With Two Machines and Time Lags
- Sequencing \(n\) jobs on two machines with arbitrary time lags
- Two-machine open shop scheduling with special transportation times
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Two-stage no-wait scheduling models with setup and removal times separated
- On non-permutation solutions to some two machine flow shop scheduling problems
- An open shop scheduling problem with a non-bottleneck machine
- Two machine open shop scheduling problem with setup, processing and removal times separated
Cited In (25)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- On-line two-machine open shop scheduling with time lags
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Scheduling in manufacturing with transportation: classification and solution techniques
- Title not available (Why is that?)
- 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
- A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
- Irreducible bin packing and normality in routing open shop
- 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
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- Transporting jobs through a two‐machine open shop
- The routing open-shop problem on a network: complexity and approximation
- 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
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Two-machine open shop scheduling with special transportation times
This page was built for publication: A heuristic for the two-machine open-shop scheduling problem with transportation times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296581)
