Pages that link to "Item:Q1570817"

The following pages link to Scheduling equal-length jobs on identical parallel machines (Q1570817):

Displaying 38 items.

• Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
• Aircraft landing problems with aircraft classes (Q398897) (← links)
• Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323) (← links)
• Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine (Q612212) (← links)
• Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
• Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
• Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
• Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
• Scheduling jobs with equal processing times and time windows on identical parallel machines (Q835604) (← links)
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
• On single-machine scheduling without intermediate delays (Q955319) (← links)
• A decomposition scheme for single stage scheduling problems (Q983632) (← links)
• On a parallel machine scheduling problem with equal processing times (Q1028485) (← links)
• On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
• Complexity results for flow-shop problems with a single server (Q1772843) (← links)
• Complexity results for parallel machine problems with a single server (Q1860370) (← links)
• Matching supply and demand in a sharing economy: classification, computational complexity, and application (Q1999391) (← links)
• Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
• Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
• An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
• Primal-dual analysis for online interval scheduling problems (Q2182859) (← links)
• A metric for total tardiness minimization (Q2362385) (← 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)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
• Scheduling two agents on uniform parallel machines with~makespan and cost functions (Q2434250) (← links)
• Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (Q2820105) (← links)
• (Q2861543) (← links)
• On the Complexity of Speed Scaling (Q2946378) (← links)
• On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• Joint replenishment meets scheduling (Q6102849) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)