Single machine flow-time scheduling with a single breakdown
From MaRDI portal
DOI10.1007/BF00288977zbMATH Open0657.68033MaRDI QIDQ1111018FDOQ1111018
Authors: Igal Adiri, Esther Frostig, John Bruno, Alexander H. G. Rinnooy Kan 
Publication date: 1989
Published in: Acta Informatica (Search for Journal in Brave)
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
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (84)
- Solving the weighted capacitated planned maintenance problem and its variants
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Single machine scheduling with linear deteriorating jobs under predictive disruption
- Single machine predictive scheduling using inserted idle times
- Cost allocation in rescheduling with machine unavailable period
- On stochastic machine scheduling with general distributional assumptions
- Short‐term scheduling with machine calibration
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Single machine scheduling with non-availability interval and optional job rejection
- Replication and sequencing of unreliable jobs on parallel machines
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
- Single machine scheduling with an operator non-availability period to minimize total completion time
- Fault tolerant scheduling of tasks of two sizes under resource augmentation
- 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 machine unavailability periods and resource dependent processing times
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- Job scheduling and management of wearing tools with stochastic tool lifetimes
- Machine scheduling with an availability constraint
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns
- The complexity of machine scheduling for stability with a single disrupted job
- Single-machine scheduling problems with machine aging effect and an optional maintenance activity
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- An anticipative scheduling approach with controllable processing times
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- Improved algorithms for two single machine scheduling problems
- Exponential inapproximability and FPTAS for scheduling with availability constraints
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Approximation algorithms for the single-machine scheduling with a period of maintenance
- Single machine scheduling with semi-resumable machine availability constraints
- Integrated scheduling of production and delivery on a single machine with availability constraint
- Optimal rules for single machine scheduling with stochastic breakdowns
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- Single machine flow-time scheduling with scheduled maintenance
- Parallel machines scheduling with machine maintenance for minsum criteria
- 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
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Single machine flow-time scheduling with a single breakdown
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Single machine unbounded parallel-batch scheduling with forbidden intervals
- Two machine scheduling under disruptions with transportation considerations
- Single machine scheduling with preventive maintenances
- Single machine scheduling under potential disruption
- Minimizing makespan on a single machine subject to random breakdowns
- STOCHASTIC SCHEDULING WITH ASYMMETRIC EARLINESS AND TARDINESS PENALTIES UNDER RANDOM MACHINE BREAKDOWNS
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- 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
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Parallel-machine scheduling under potential disruption
- Integrated production planning and preventive maintenance in deteriorating production systems
- Title not available (Why is that?)
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Scheduling with limited machine availability
- Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
- An integrated production and preventive maintenance planning model
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Single-machine scheduling with maintenance and repair rate-modifying activities
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Scheduling for stability in single-machine production systems
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Approximation schemes for parallel machine scheduling with availability constraints
- Two-machine flowshop scheduling with availability constraints
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Robust single machine scheduling with a flexible maintenance activity
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Approximability of single machine scheduling with fixed jobs to minimize total completion time
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Machine scheduling with a rate-modifying activity
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Match-up scheduling under a machine breakdown
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
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)
