Advertisement

Shop problems with assignment

Chapter
  • 120 Downloads

Abstract

[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 .

Keywords

Schedule Problem Completion Time Tabu Search Setup Time Mixed Linear Integer Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Laboratoire d’InformatiqueUniversité François-Rabelais ToursToursFrance

Personalised recommendations