Pages that link to "Item:Q1964484"

The following pages link to Approximability of scheduling with fixed jobs (Q1964484):

Displaying 26 items.

• Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
• Fixed-time schedules for the processing of jobs when service completions are not observable (Q814885) (← links)
• Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
• Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption (Q881562) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← links)
• A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
• FPT approximation algorithm for scheduling with memory constraints (Q1693210) (← links)
• Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
• Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711) (← links)
• Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
• Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
• Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983) (← links)
• MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
• SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354) (← links)
• Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• (Q6068238) (← links)