Pages that link to "Item:Q1885337"

The following pages link to Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337):

Displaying 33 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
• Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
• Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines (Q632642) (← links)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs (Q839781) (← links)
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
• A decomposition scheme for single stage scheduling problems (Q983632) (← links)
• Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
• On a parallel machine scheduling problem with equal processing times (Q1028485) (← links)
• Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
• Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
• The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints (Q1779705) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• On polynomial solvability of two multiprocessor scheduling problems (Q1806278) (← links)
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
• Integer preemptive scheduling on parallel machines (Q1939681) (← links)
• Ideal schedules in parallel machine settings (Q2029359) (← links)
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
• On the optimality of the earliest due date rule in stochastic scheduling and in queueing (Q2076926) (← links)
• Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
• A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
• Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
• A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
• A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
• (Q6065401) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Time-of-use scheduling problem with equal-length jobs (Q6111939) (← links)
• Approximations for Throughput Maximization (Q6492088) (← links)