Preemptive scheduling on two identical parallel machines with a single transporter
From MaRDI portal
Publication:1944394
DOI10.1007/s10878-012-9511-xzbMath1267.90052OpenAlexW2152903775MaRDI QIDQ1944394
Vitaly A. Strusevich, Hans Kellerer, Alan J. Soper
Publication date: 25 March 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://gala.gre.ac.uk/id/eprint/8516/1/8516_SOPER_STRUSEVICH_%28AAM%29_%282013%29.pdf
Cites Work
- Unnamed Item
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- Approximability of flow shop scheduling
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Transporting Jobs through a Processing Center with Two Parallel Machines
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- Transporting jobs through a two‐machine open shop
- Shop Problems With Two Machines and Time Lags
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: Preemptive scheduling on two identical parallel machines with a single transporter
