Pages that link to "Item:Q1273117"

The following pages link to Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem (Q1273117):

Displaying 23 items.

• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
• Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. (Q703238) (← links)
• Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
• Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
• A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282) (← links)
• Search tree based approaches for parallel machine scheduling (Q941538) (← links)
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
• A new LP-based lower bound for the cumulative scheduling problem (Q1590042) (← links)
• Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
• Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
• Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
• Lower bounds for the event scheduling problem with consumption and production of resources (Q1686062) (← links)
• An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
• Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
• An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)
• An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608) (← links)
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
• Scheduling with tails and deadlines (Q5937434) (← links)
• Algorithms to compute the energetic lower bounds of the cumulative scheduling problem (Q6581391) (← links)
• Measuring the slack between lower bounds for scheduling on parallel machines (Q6588485) (← links)