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