Pages that link to "Item:Q1964481"

The following pages link to Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481):

Displaying 40 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
• Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem (Q490323) (← links)
• Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
• Two-agent scheduling on uniform parallel machines with min-max criteria (Q744634) (← links)
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
• An efficient approximation for the generalized assignment problem (Q845859) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• A note on scheduling equal-length jobs to maximize throughput (Q880531) (← links)
• The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
• On single-machine scheduling without intermediate delays (Q955319) (← links)
• A decomposition scheme for single stage scheduling problems (Q983632) (← links)
• Priority algorithms for the subset-sum problem (Q1029701) (← links)
• On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
• Open shop scheduling problems with late work criteria. (Q1421458) (← links)
• Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
• Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← 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)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
• Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← 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)
• Runway sequencing with holding patterns (Q2482798) (← links)
• On the Complexity of Speed Scaling (Q2946378) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
• Throughput scheduling with equal additive laxity (Q5918523) (← links)
• Throughput scheduling with equal additive laxity (Q5925675) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
• On maximum bipartite matching with separation (Q6161448) (← links)
• Scheduling a single machine with multiple due dates per job (Q6657886) (← links)