Minimizing the weighted completion time on a single machine with periodic maintenance. - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year : 2016

Minimizing the weighted completion time on a single machine with periodic maintenance.

Abstract

We consider in this work, a single machine problem with periodic maintenance activities. The objective is to minimize the weighted completion time of the jobs. The preemption of jobs is not allowed. Most of past studies considered such a scheduling problem but not for the same objective. We propose a MIP formulation to solve optimally this problem for small instances, then we present a new property which helps us solving the problem with an efficient and effective heuristic designed to solve the big instances.
No file

Dates and versions

hal-03388253 , version 1 (20-10-2021)

Identifiers

  • HAL Id : hal-03388253 , version 1

Cite

Hanane Krim, Rachid Benmansour, David Duvivier. Minimizing the weighted completion time on a single machine with periodic maintenance.. Conférence ROADEF 2016, Feb 2016, Compiègne, France. pp.2. ⟨hal-03388253⟩
15 View
0 Download

Share

Gmail Facebook X LinkedIn More