Pages that link to "Item:Q1111018"

The following pages link to Single machine flow-time scheduling with a single breakdown (Q1111018):

Displaying 50 items.

• Approximation algorithms for the single-machine scheduling with a period of maintenance (Q279822) (← links)
• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
• Semi-online scheduling on a single machine with unexpected breakdown (Q306274) (← links)
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time (Q322965) (← links)
• Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints (Q356114) (← 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)
• 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)
• Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512) (← 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)
• Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
• Scheduling with tool changes to minimize total completion time: Basic results and SPT performance (Q703937) (← 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 flow-time scheduling with scheduled maintenance (Q811593) (← links)
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
• Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns (Q829166) (← links)
• Scheduling for stability in single-machine production systems (Q835553) (← links)
• Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
• Improved algorithms for two single machine scheduling problems (Q860871) (← links)
• Scheduling with tool changes to minimize total completion time under controllable machining conditions (Q868153) (← links)
• An integrated production and preventive maintenance planning model (Q877045) (← links)
• Two machine scheduling under disruptions with transportation considerations (Q880527) (← links)
• Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← links)
• Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period (Q887888) (← links)
• Job scheduling and management of wearing tools with stochastic tool lifetimes (Q955695) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← 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)
• Single machine flow-time scheduling with a single breakdown (Q1111018) (← links)
• On stochastic machine scheduling with general distributional assumptions (Q1291772) (← links)
• Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
• Machine scheduling with a rate-modifying activity (Q1592740) (← links)
• Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates (Q1652182) (← links)
• Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures (Q1688445) (← links)
• Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
• Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost (Q1706684) (← links)
• Optimal rules for single machine scheduling with stochastic breakdowns (Q1717990) (← links)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← links)
• Preemptive scheduling with availability constraints to minimize total weighted completion times (Q1772973) (← links)
• Match-up scheduling under a machine breakdown (Q1806884) (← 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)