A polynomial approximation scheme for a constrained flow-shop scheduling problem

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Theoretical Computer Science

Minimizing makespan in a two-stage system with flowshop and open shop

Computers and Industrial Engineering

Minimizing makespan in a two-stage system with flowshop and open shop

Computers and Industrial Engineering

Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling

An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

Computers and Operations Research

A polynomial approximation scheme for problem F2/rj/Cmax

Operations Research Letters

Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters