A heuristic for the two-machine open-shop scheduling problem with transportation times
From MaRDI portal
Publication:1296581
DOI10.1016/S0166-218X(99)00115-8zbMath0941.90037OpenAlexW1987867541MaRDI QIDQ1296581
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
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On-line two-machine open shop scheduling with time lags ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ 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 ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ On the complexity of open shop scheduling with time lags ⋮ Preemptive scheduling on two identical parallel machines with a single transporter ⋮ From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Irreducible bin packing and normality in routing open shop ⋮ The routing open-shop problem on a network: complexity and approximation ⋮ A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network ⋮ A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays ⋮ Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm ⋮ Transporting jobs through a two‐machine open shop ⋮ 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
Cites Work
- An open shop scheduling problem with a non-bottleneck machine
- Two-stage no-wait scheduling models with setup and removal times separated
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Two-machine open shop scheduling with special transportation times
- Open shop scheduling with delays
- Open Shop Scheduling to Minimize Finish Time
- On non-permutation solutions to some two machine flow shop scheduling problems
- Shop Problems With Two Machines and Time Lags
- Short Shop Schedules
- Sequencing n jobs on two machines with setup, processing and removal times separated
This page was built for publication: A heuristic for the two-machine open-shop scheduling problem with transportation times
