A heuristic for the two-machine open-shop scheduling problem with transportation times
From MaRDI portal
(Redirected from Publication:1296581)
Recommendations
- Two-machine open shop scheduling with special transportation times
- scientific article; zbMATH DE number 4137522
- A heuristic algorithm for open-shop scheduling problems with a single server
- Scheduling two-machine preemptive open shops to minimize total completion time
- scientific article; zbMATH DE number 1279216
Cites work
- An open shop scheduling problem with a non-bottleneck machine
- On non-permutation solutions to some two machine flow shop scheduling problems
- Open Shop Scheduling to Minimize Finish Time
- Open shop scheduling with delays
- Sequencing \(n\) jobs on two machines with arbitrary time lags
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Shop Problems With Two Machines and Time Lags
- Short Shop Schedules
- Two machine open shop scheduling problem with setup, processing and removal times separated
- Two-machine open shop scheduling with special transportation times
- Two-stage no-wait scheduling models with setup and removal times separated
Cited in
(25)- scientific article; zbMATH DE number 4108473 (Why is no real title available?)
- Transporting jobs through a two‐machine open shop
- On a routing open shop problem on two nodes with unit processing times
- 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
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Scheduling in manufacturing with transportation: classification and solution techniques
- Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
- scientific article; zbMATH DE number 4131935 (Why is no real title available?)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
- scientific article; zbMATH DE number 4137522 (Why is no real title available?)
- Two-machine open shop scheduling with special transportation times
- On-line two-machine open shop scheduling with time lags
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Preemptive scheduling on two identical parallel machines with a single transporter
- Irreducible bin packing and normality in routing open shop
- A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Reentrant open shop scheduling problem with time lags and no-wait constraints
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- On the complexity of open shop scheduling with time lags
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Polynomial-time approximation schemes for scheduling problems with time lags
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)
