Scheduling tasks on two processors with deadlines and additional resources

DOI10.1016/0377-2217(86)90138-4zbMath0605.90073OpenAlexW2018082550WikidataQ57387928 ScholiaQ57387928MaRDI QIDQ1084012

B. George

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90138-4

zbMATH Keywords

deadlinesresource constraintsadditional resourcesNP- hardnessfinite set of identical processorstwo major open nonpreemptive scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Minimizing mean flow time with parallel processors and resource constraints ⋮ Scheduling: agreement graph vs resource constraints ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Restricted assignment scheduling with resource constraints ⋮ Algorithms for minimizing maximum lateness with unit length tasks and resource constraints ⋮ On the complexity of a restricted list-coloring problem ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplified NP-complete satisfiability problem
• Scheduling subject to resource constraints: Classification and complexity
• Deadline scheduling of tasks with ready times and resource constraints
• A linear time algorithm for restricted bin packing and scheduling problems
• Some new results in flow shop scheduling
• Preemptive Scheduling, Linear Programming and Network Flows
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The complexity of satisfiability problems

This page was built for publication: Scheduling tasks on two processors with deadlines and additional resources