A note on single processor scheduling with time restrictions

MaRDI QIDQ4690459zbMATH OpenFDO

Authors Shaochun Wan, An Zhang, Yong Chen, Guang-Ting Chen

Publication date 22 October 2018

zbMATH Keywords

optimalityheuristic algorithmtime restrictionssingle processor scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-processor scheduling with time restrictions
• Better permutations for the single-processor scheduling with time restrictions
• On the NP-hardness of scheduling with time restrictions
• The single-processor scheduling problem with time restrictions: complexity and related problems
• A note on scheduling on a single processor with speed dependent on a number of executed jobs

Cited in

(9)

• On the NP-hardness of scheduling with time restrictions
• The single-processor scheduling problem with time restrictions: complexity and related problems
• A note on LPT scheduling
• Some results on position restriction scheduling problems
• On a scheduling problem where a job can be executed only by a limited number of processors
• A multiperiod single processor scheduling problem with periodic requirements
• Better permutations for the single-processor scheduling with time restrictions
• An algorithm for constructing single processor static-dynamic schedules
• Single-processor scheduling with time restrictions

This page was built for publication: A note on single processor scheduling with time restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690459)