Single machine flow-time scheduling with a single breakdown
From MaRDI portal
Recommendations
- Single-machine scheduling subject to stochastic breakdowns
- Optimal rules for single machine scheduling with stochastic breakdowns
- STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME
- Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
- Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria
Cites work
Cited in
(84)- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- Replication and sequencing of unreliable jobs on parallel machines
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
- Cost allocation in rescheduling with machine unavailable period
- Solving the weighted capacitated planned maintenance problem and its variants
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Single machine scheduling with linear deteriorating jobs under predictive disruption
- Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
- Single machine scheduling with an operator non-availability period to minimize total completion time
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
- Single machine predictive scheduling using inserted idle times
- On stochastic machine scheduling with general distributional assumptions
- Short‐term scheduling with machine calibration
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Fault tolerant scheduling of tasks of two sizes under resource augmentation
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Single machine scheduling with non-availability interval and optional job rejection
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Single machine flow-time scheduling with scheduled maintenance
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Parallel-machine scheduling under potential disruption
- Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period
- Supply chain scheduling problem in the hospital with periodic working time on a single machine
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
- Single-machine scheduling with maintenance and repair rate-modifying activities
- An anticipative scheduling approach with controllable processing times
- Integrated production planning and preventive maintenance in deteriorating production systems
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- The complexity of machine scheduling for stability with a single disrupted job
- Approximation algorithms for the single-machine scheduling with a period of maintenance
- Minimizing makespan on a single machine subject to random breakdowns
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Approximation schemes for parallel machine scheduling with availability constraints
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Two-machine flowshop scheduling with availability constraints
- Two machine scheduling under disruptions with transportation considerations
- Single machine scheduling with preventive maintenances
- Scheduling for stability in single-machine production systems
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- Scheduling with limited machine availability
- Approximability of single machine scheduling with fixed jobs to minimize total completion time
- Match-up scheduling under a machine breakdown
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Job scheduling and management of wearing tools with stochastic tool lifetimes
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
- Semi-online scheduling on a single machine with unexpected breakdown
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Machine scheduling with an availability constraint
- An integrated production and preventive maintenance planning model
- Robust single machine scheduling with a flexible maintenance activity
- Integrated scheduling of production and delivery on a single machine with availability constraint
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Optimal rules for single machine scheduling with stochastic breakdowns
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Parallel machines scheduling with machine maintenance for minsum criteria
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Single machine scheduling with semi-resumable machine availability constraints
- Single-machine scheduling problems with machine aging effect and an optional maintenance activity
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- scientific article; zbMATH DE number 1389747 (Why is no real title available?)
- Single machine scheduling under potential disruption
- Machine scheduling with a rate-modifying activity
- Improved algorithms for two single machine scheduling problems
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Single machine flow-time scheduling with a single breakdown
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
This page was built for publication: Single machine flow-time scheduling with a single breakdown
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111018)
