Machine scheduling with an availability constraint
From MaRDI portal
Publication:2564885
DOI10.1007/BF00121681zbMath0870.90071OpenAlexW1994566591MaRDI QIDQ2564885
Publication date: 7 January 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00121681
heuristicserror boundperformance measuresmachine breakdownavailability constraintpseudo-polynomial dynamic programming
Related Items (only showing first 100 items - show all)
Approximation schemes for scheduling a maintenance and linear deteriorating jobs ⋮ A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ Parallel-machine scheduling with potential disruption and positional-dependent processing times ⋮ 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 ⋮ Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval ⋮ Open shop scheduling problem with a non-resumable flexible maintenance period ⋮ Machine scheduling performance with maintenance and failure ⋮ Approximability of single machine scheduling with fixed jobs to minimize total completion time ⋮ A scheduling problem with three competing agents ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Single-machine scheduling with periodic maintenance to minimize makespan ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ 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 ⋮ A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Single Machine Scheduling with an Availability Constraint and Rejection ⋮ Single machine scheduling with non-availability interval and optional job rejection ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ Parallel-machine scheduling with time-dependent and machine availability constraints ⋮ Coordinated optimization of production scheduling and maintenance activities with machine reliability deterioration ⋮ An integrated production and preventive maintenance planning model ⋮ iGreen: green scheduling for peak demand minimization ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time ⋮ 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 ⋮ An on-line scheduling problem of parallel machines with common maintenance time ⋮ An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown ⋮ Minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Equivalence of some different maintenance activities in single-machine scheduling ⋮ An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs ⋮ Single machine unbounded parallel-batch scheduling with forbidden intervals ⋮ Parallel machines scheduling with machine maintenance for minsum criteria ⋮ Scheduling on same-speed processors with at most one downtime on each machine ⋮ Single machine scheduling with small operator-non-availability periods ⋮ Bi-criteria scheduling on a single parallel-batch machine ⋮ Multitasking scheduling with alternate periods ⋮ Approximation schemes for parallel machine scheduling with availability constraints ⋮ Minimizing the makespan for the flow shop scheduling problem with availability constraints. ⋮ 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 ⋮ Integrated scheduling of production and delivery on a single machine with availability constraint ⋮ Rescheduling for machine disruption to minimize makespan and maximum lateness ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Robust single machine scheduling with a flexible maintenance activity ⋮ Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals ⋮ Parallel-machine scheduling under potential disruption ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ Multi-machine scheduling with deteriorating jobs and scheduled maintenance ⋮ Job scheduling and management of wearing tools with stochastic tool lifetimes ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Order acceptance and scheduling with machine availability constraints ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Parallel machines scheduling with deteriorating jobs and availability constraints ⋮ 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 ⋮ Bi-objective ant colony optimization approach to optimize production and maintenance scheduling ⋮ Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Scheduling linear deteriorating jobs with an availability constraint on a single machine ⋮ Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint ⋮ Two-machine scheduling with periodic availability constraints to minimize makespan ⋮ Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery ⋮ Match-up scheduling under a machine breakdown ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Makespan minimization for parallel machines scheduling with multiple availability constraints ⋮ Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance ⋮ The coordination of single-machine scheduling with availability constraints and delivery ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Single machine scheduling with forbidden start times ⋮ Approximation algorithms for single machine scheduling with one unavailability period ⋮ Exponential inapproximability and FPTAS for scheduling with availability constraints ⋮ Rescheduling due to machine disruption to minimize the total weighted completion time ⋮ Operator non-availability periods ⋮ 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 ⋮ Two-machine flowshop scheduling with availability constraints ⋮ Machine scheduling with a rate-modifying activity ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval ⋮ Combined production-maintenance decisions in situations with process deterioration ⋮ Heuristics for two-machine no-wait flowshop scheduling with an availability constraint ⋮ Single-machine scheduling with periodic maintenance and nonresumable jobs.
Cites Work
- Parallel machines scheduling with nonsimultaneous machine available time
- Single machine flow-time scheduling with a single breakdown
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Minimizing the sum of job completion times on capacitated parallel machines
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- A Review of Production Scheduling
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
- Approximate Algorithms for the 0/1 Knapsack Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Machine scheduling with an availability constraint
