Pages that link to "Item:Q1266535"

The following pages link to Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535):

Displaying 34 items.

• Personnel scheduling and supplies provisioning in emergency relief operations (Q256662) (← links)
• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540) (← links)
• Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
• Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
• A job-shop problem with one additional resource type (Q640303) (← links)
• On distance constrained labeling of disk graphs (Q703553) (← links)
• A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
• Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks (Q880507) (← links)
• Computational complexity of some scheduling problems with multiprocessor tasks (Q1019301) (← links)
• Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
• Polynomial algorithms for single machine scheduling problems with financial constraints (Q1371954) (← links)
• Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
• Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Multicoloring trees. (Q1401922) (← links)
• Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328) (← links)
• On polynomial solvability of two multiprocessor scheduling problems (Q1806278) (← links)
• Scheduling of resource tasks (Q1809809) (← links)
• Production, maintenance and resource scheduling: a review (Q2098022) (← links)
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888) (← links)
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577) (← links)
• A polynomial algorithm for multiprocessor scheduling with two job lengths. (Q2757667) (← links)
• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631) (← links)
• (Q3750498) (← links)
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
• (Q4527315) (← links)
• Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605) (← links)
• (Q4866315) (← links)
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)