Pages that link to "Item:Q2467254"

The following pages link to Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period (Q2467254):

Displaying 21 items.

• The third comprehensive survey on scheduling problems with setup times/costs (Q319774) (← links)
• Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← links)
• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← 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)
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← 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)
• Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← 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)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs (Q3163792) (← links)