Skip to Main content Skip to Navigation
Journal articles

The single-processor scheduling problem with time restrictions: complexity and related problems

Abstract : We consider the single-processor scheduling problem with time restrictions (STR) in order to minimize the makespan, where a set of independent jobs has to be processed on a single processor, subject only to the following constraint: During any time period of length α, the number of jobs being executed is less than or equal to a given integer value B. First, we prove that the STR problem is binary NP-hard even for B=2 by pointing out an interesting analogy of this problem to the parallel machine scheduling problem with a single server with equal processing times. Next, we give a formal description of the STR problem by providing two mixed integer programming formulations to solve it optimally. The first is based on time-indexed variables and the second is based on assignment and positional date variables (APV). Both models were tested on randomly generated instances, and the experimental results show that the APV model performs very well and can solve problem instances of up to n=500 jobs.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03574467
Contributor : Julie Cagniard Connect in order to contact the contributor
Submitted on : Tuesday, February 15, 2022 - 10:29:14 AM
Last modification on : Thursday, May 19, 2022 - 10:44:07 AM

Identifiers

Collections

Citation

Rachid Benmansour, Oliver Braun, Said Hanafi. The single-processor scheduling problem with time restrictions: complexity and related problems. Journal of Scheduling, Springer Verlag, 2019, 22 (4), pp.465-471. ⟨10.1007/s10951-018-0579-8⟩. ⟨hal-03574467⟩

Share

Metrics

Record views

8