New conditions of dominance and optimality for single-machine scheduling problems with nested execution intervals

Simple item page
dc.contributor.authorOurari, Samia
dc.contributor.authorYalaoui, Farouk
dc.date.accessioned2024-10-24T12:05:16Z
dc.date.available2024-10-24T12:05:16Z
dc.date.issued2024
dc.description.abstractIn this paper, we consider the problem of scheduling a set of n + 1 jobs on a single disjunctive machine. Each job has a fixed processing time and a temporal execution interval. Pre-emption is not allowed. Temporal execution intervals are assumed to have a perfect pyramidal structure, i.e., the execution intervals of the jobs are nested within each other, or none two of them are contained within each other. The objective is to find a feasible sequence that minimises the maximum lateness under some particular constraints. In order to do so, new dominance properties under known necessary and sufficient conditions are established, and optimality conditions of certain job sequences are given.en_US
dc.identifier.issn1757-5850
dc.identifier.urihttps://www.inderscienceonline.com/doi/abs/10.1504/IJMOR.2024.142135
dc.identifier.urihttps://doi.org/10.1504/IJMOR.2024.142135
dc.identifier.urihttps://dspace.univ-boumerdes.dz/handle/123456789/14537
dc.language.isoenen_US
dc.publisherInderscience Publishersen_US
dc.relation.ispartofseriesInternational Journal of Mathematics in Operational Research/Vol. 29, N° 2(2024);pp. 191 - 213
dc.subjectDominance conditionsen_US
dc.subjectNested or perfect intervalsen_US
dc.subjectOptimality conditionen_US
dc.subjectScheduling rulesen_US
dc.subjectSingle-machine schedulingen_US
dc.titleNew conditions of dominance and optimality for single-machine scheduling problems with nested execution intervalsen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Publications Internationales