Scheduling jobs on parallel machines to minimize a regular step total cost function

Abstract : This paper deals with an optimization problem in which a set of inspection operations have to be processed so that a fixed production schedule is as reliable as possible. The problem is formalized as a single machine scheduling problem whose objective is to minimize a regular step total cost function. Mixed Integer Linear Programming models and Lagragean relaxation are described for the case without release dates. Experimental results are reported and discussed to evaluate the performance of a standard mathematical programming solver applied to different special cases and to the general case.
Type de document :
Article dans une revue
Journal of Scheduling, Springer Verlag, 2011, 14 (6), pp.523-538. 〈10.1007/s10951-010-0203-z〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00613037
Contributeur : Stéphane Dauzère-Pérès <>
Soumis le : mardi 2 août 2011 - 11:36:53
Dernière modification le : mercredi 29 novembre 2017 - 10:08:14

Identifiants

Collections

Citation

Boris Detienne, Stéphane Dauzère-Pérès, Claude Yugma. Scheduling jobs on parallel machines to minimize a regular step total cost function. Journal of Scheduling, Springer Verlag, 2011, 14 (6), pp.523-538. 〈10.1007/s10951-010-0203-z〉. 〈emse-00613037〉

Partager

Métriques

Consultations de la notice

88