Algorithmic problems in power management
ACM SIGACT News
An exact approach to early/tardy scheduling with release dates
Computers and Operations Research
On single-machine scheduling without intermediate delays
Discrete Applied Mathematics
Exact resolution of the one-machine sequencing problem with no machine idle time
Computers and Industrial Engineering
| Hi-index | 0.04 |
In this paper, we study the basic homogeneous m-machine scheduling problem where weakly dependent unit-time jobs have to be scheduled within the time windows between their release dates and due dates so that, for any subset of machines, the set of the time units at which at least one machine is busy, is in interval. We first introduce the notions of pyramidal structure, k-hole, m-matching, preschedule, k-schedule and schedule for this problem. Then we provide a feasibility criteria for a preschedule. The key result of the paper is then to provide a structural necessary and sufficient condition for an instance of the problem to be feasible. We conclude by giving the directions of ongoing works and by bringing open questions related to different variants of the basic non-idling m-machine scheduling problem.