A note on single processor scheduling with time restrictions

zbMATH Open1413.90099MaRDI QIDQ4690459FDOQ4690459

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

Publication date: 22 October 2018

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

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)

Cited In (9)

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