Approximating the $2$-Machine Flow Shop Problem with Exact Delays Taking Two Values

31 Oct 2017 Ageev Alexander

In the $2$-Machine Flow Shop problem with exact delays the operations of each job are separated by a given time lag (delay). Leung et al. (2007) established that the problem is strongly NP-hard when the delays may have at most two different values... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS

Datasets


  Add Datasets introduced or used in this paper