Lower bounds for total weighted completion scheduling problem with availability constraints - Université de technologie de Troyes Access content directly
Conference Papers Year : 2009

Lower bounds for total weighted completion scheduling problem with availability constraints

Abstract

In this paper we consider the single machine total weighted completion scheduling problem with availability constraints. The machine is subject to many periods of maintenances. To solve this problem, we propose some lower bounds. A computational experiments and analysis are given afterwards to test the efficiency of the proposed lower bounds.
No file

Dates and versions

hal-02496074 , version 1 (02-03-2020)

Identifiers

Cite

Cherif Sadfi, Imed Kacem, Wei Liu. Lower bounds for total weighted completion scheduling problem with availability constraints. Industrial Engineering (CIE39), Jul 2009, Troyes, France. pp.159-163, ⟨10.1109/ICCIE.2009.5223882⟩. ⟨hal-02496074⟩
22 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More