Pages that link to "Item:Q4170215"

The following pages link to On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming (Q4170215):

Displaying 50 items.

• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
• A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
• On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
• On the max-weight edge coloring problem (Q613668) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• An improved approximation algorithm for the partial Latin square extension problem. (Q703265) (← links)
• A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty (Q763115) (← links)
• Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
• Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
• Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
• A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188) (← links)
• Scheduling algorithms for procrastinators (Q835586) (← links)
• Minimizing the stretch when scheduling flows of divisible requests (Q835622) (← links)
• On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
• Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
• A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
• Data transfers in networks (Q1097687) (← links)
• Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
• Scheduling periodically occurring tasks on multiple processors (Q1149764) (← links)
• Scheduling open shops with parallel machines (Q1167065) (← links)
• On the complexity of generalized due date scheduling problems (Q1175769) (← links)
• On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
• Parallel machine scheduling with splitting jobs (Q1570839) (← links)
• Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
• Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
• Restricted assignment scheduling with resource constraints (Q1713408) (← links)
• A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints (Q1754044) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
• A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
• On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
• The battery switching station scheduling problem (Q1939710) (← links)
• Ideal schedules in parallel machine settings (Q2029359) (← links)
• Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
• Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
• On the optimality of the earliest due date rule in stochastic scheduling and in queueing (Q2076926) (← links)
• Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
• A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)