TNCY-I
Description
The dataset used for benchmarking the Hybrid Flow Shop problem with time-varying resources and chaining exact time-lag (noted FHc-EV). Given A jobs arrived as multiple chains Q[n] (1 <= n <= N) at the beginning of the horizon. Each chain Q[n] is a sequence of a[n] jobs J[n][i] (1 <= i <= a[n]) with exact time-lag l[n][i] between two consecutive jobs J[n][i] and J[n][i+1]. Each job J[n][i] consists of m operations. Each operation o of the job J[n][i] has a non-preemptive processing time p[n][i][o]. For each resource v, each operation o needs a certain amount u[o][v] per unit of time during its processing time. The resources' capacity of any resource v at any time t is denoted by R[v][t]. The criterion is minimizing the total completion time.
Files
Steps to reproduce
The procedure is described in detail at: Tran, Q.N.H., Nguyen, N.Q., Yalaoui, F., Amodeo, L., Chehade, H., 2022. Improved formulations and new valid inequalities for a Hybrid Flow Shop problem with time-varying resources and chaining time-lag. Computers & Operations Research 106018. https://doi.org/10.1016/j.cor.2022.106018