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

DOI10.1007/s10951-018-0579-8zbMath1442.90067OpenAlexW2884272406MaRDI QIDQ2304117

Rachid Benmansour, Saïd Hanafi, Oliver Braun

Publication date: 6 March 2020

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-018-0579-8

zbMATH Keywords

schedulingmixed integer programmingNP-hardtime restrictionssingle processorparallel machine scheduling with a single server

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On the minimum number of resources for a perfect schedule ⋮ EPTAS for parallel identical machine scheduling with time restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
• Single-processor scheduling with time restrictions
• Better permutations for the single-processor scheduling with time restrictions
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Parallel machine scheduling problems with a single server
• A time indexed formulation of non-preemptive single machine scheduling problems
• Parallel machine scheduling with a common server
• On the NP-hardness of scheduling with time restrictions
• MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
• Complexity results for parallel machine problems with a single server
• New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
• On the facial structure of scheduling polyhedra
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Scheduling for parallel dedicated machines with a single server
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Handbook on Scheduling
• Scheduling
• Scheduling parallel machines with a single server: Some solvable cases and heuristics

This page was built for publication: The single-processor scheduling problem with time restrictions: complexity and related problems