[Fortemps et al., 1996] are interested in a scheduling problem which occurs in the chemical industry, denoted by HF 3, (P6, P3, 1)|constr|F ℓ (C max ,γ(T i ), δ(VPI)), where constr translates a set of constraints described hereafter. The shop comprises three stages. Each job J i is defined by a release date, and a due date. Each machine M j also has an availability date, denoted by R j .
KeywordsSchedule Problem Completion Time Tabu Search Setup Time Mixed Linear Integer Program
Unable to display preview. Download preview PDF.