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

Rachid Benmansour (), Oliver Braun () and Saïd Hanafi ()
Additional contact information
Rachid Benmansour: Institut National de Statistique et d’Économie Appliquée
Oliver Braun: Trier University of Applied Sciences
Saïd Hanafi: University of Valenciennes and Hainaut Cambrésis

Journal of Scheduling, 2019, vol. 22, issue 4, No 6, 465-471

Abstract: 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 $$\alpha $$ α , 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$$ 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$$ n = 500 jobs.

Keywords: Scheduling; Time restrictions; Single processor; NP-hard; Mixed integer programming; Parallel machine scheduling with a single server (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-018-0579-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jsched:v:22:y:2019:i:4:d:10.1007_s10951-018-0579-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-018-0579-8

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().