Show simple item record

AuthorGharbi, Anis
AuthorLabidi, Mohamed
AuthorHaouari, Mohamed
Available date2023-01-23T08:18:13Z
Publication Date2015
Publication NameEuropean Journal of Industrial Engineering
ResourceScopus
URIhttp://dx.doi.org/10.1504/EJIE.2015.068654
URIhttp://hdl.handle.net/10576/38704
AbstractWe investigate the single machine scheduling problem with job release dates and due dates, and multiple planned unavailability time periods. This problem arises in the context of machine scheduling with planned preventive maintenance and might be viewed as a generalisation of several fundamental single-machine problems. The contribution of this paper is two-fold. First, we propose a new lower bound that is based on the concept of semi-preemptive scheduling. Second, we propose an exact algorithm that requires solving a sequence of one-machine problems without availability constraints. We report the results of extensive computational experiments that provide evidence that the semi-preemptive lower bound is very tight and that the proposed algorithm consistently delivers optimal solution for instances with up to 1,000 jobs while requiring short CPU times. Copyright 2015 Inderscience Enterprises Ltd.
Languageen
PublisherInderscience Publishers
SubjectDelivery times
Maximum lateness
Release dates
Scheduling
Single-machine
Unavailability constraints
TitleAn exact algorithm for the single machine problem with unavailability periods
TypeArticle
Pagination244-260
Issue Number2
Volume Number9
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record