A heuristic for two-machine open-shop scheduling problem with transportation times

Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics

Expert Systems with Applications: An International Journal

A 3/2-approximation for the proportionate two-machine flow shop scheduling with minimum delays

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms

Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling

Transporting jobs through a processing center with two parallel machines

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I

The routing open shop problem: new approximation algorithms

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms

Efficient approximation algorithms for the routing open shop problem

Computers and Operations Research

Preemptive scheduling on two identical parallel machines with a single transporter

Journal of Combinatorial Optimization