Pages that link to "Item:Q1887763"

The following pages link to An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763):

Displaying 46 items.

• Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
• Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
• Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
• Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Integrated scheduling of production and delivery on a single machine with availability constraint (Q476906) (← links)
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time (Q497629) (← links)
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• An improved approximation algorithm for single machine scheduling with job delivery (Q621846) (← links)
• Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
• Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← links)
• Single-machine scheduling with periodic maintenance to minimize makespan (Q858282) (← links)
• Improved algorithms for two single machine scheduling problems (Q860871) (← links)
• A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
• Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← links)
• Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
• Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times (Q1042030) (← links)
• Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
• Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints (Q1887763) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance (Q2301137) (← links)
• Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← links)
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint (Q2429001) (← links)
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times (Q2456641) (← links)
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
• Single Machine Scheduling with an Availability Constraint and Rejection (Q2931173) (← links)
• Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion Time (Q3004670) (← links)
• Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint (Q3451058) (← 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)
• Algorithmic Applications in Management (Q5710156) (← links)
• Short‐term scheduling with machine calibration (Q6082198) (← links)
• Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities (Q6534463) (← links)