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

Samia Ourari and Farouk Yalaoui

International Journal of Mathematics in Operational Research, 2024, vol. 29, issue 2, 191-213

Abstract: In 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.

Keywords: single-machine scheduling; nested or perfect intervals; dominance conditions; optimality condition; scheduling rules. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=142135 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:29:y:2024:i:2:p:191-213

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().