Scheduling with limited machine availability
From MaRDI portal
Publication:1969884
DOI10.1016/S0377-2217(98)00367-1zbMath0959.90023OpenAlexW1995313677MaRDI QIDQ1969884
Publication date: 6 May 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00367-1
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Optimal versus heuristic scheduling of surface mount technology lines ⋮ Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs ⋮ Dual Techniques for Scheduling on a Machine with Varying Speed ⋮ Scheduling jobs in open shops with limited machine availability ⋮ A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups ⋮ Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Replication and sequencing of unreliable jobs on parallel machines ⋮ Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity ⋮ Online scheduling with deterioration and unexpected processor breakdown ⋮ Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration ⋮ Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration ⋮ SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES ⋮ New expression of scheduling performance measures ⋮ Integrated production planning and preventive maintenance in deteriorating production systems ⋮ COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ Minimizing maximum tardiness in single FMS machine scheduling with tool changes ⋮ Scheduling with variable time slot costs ⋮ Two-machine open shop scheduling with an availability constraint ⋮ Proactive, dynamic and multi-criteria scheduling of maintenance activities ⋮ Single machine scheduling with preventive maintenances ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Two-machine flow shop scheduling integrated with preventive maintenance planning ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ Scheduling a maintenance activity on parallel identical machines ⋮ Stability of Johnson's schedule with respect to limited machine availability ⋮ Scheduling Resources for Throughput Maximization ⋮ MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS ⋮ Optimality of Jackson's permutations with respect to limited machine availability ⋮ Modeling of a scheduling problem with expected availability of resources ⋮ Scheduling jobs and maintenance activities on parallel machines ⋮ Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms ⋮ Approximation algorithms for the single-machine scheduling with a period of maintenance ⋮ 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 ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization ⋮ 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 ⋮ Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ Single-machine scheduling with resource-dependent processing times and multiple unavailability periods ⋮ Total completion time minimization on multiple machines subject to machine availability and makespan constraints ⋮ A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ 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 ⋮ Integrated production scheduling and maintenance policy for robustness in a single machine ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ Single-machine scheduling with periodic maintenance to minimize makespan ⋮ Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates ⋮ An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint ⋮ Patient scheduling with periodic deteriorating maintenance on single medical device ⋮ 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 ⋮ A note on worst-case performance of heuristics for maintenance scheduling problems ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Scheduling deteriorating jobs subject to job or machine availability constraints ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures ⋮ Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ An alternative framework to Lagrangian relaxation approach for job shop scheduling. ⋮ Single-machine scheduling with operator non-availability to minimize total weighted completion time ⋮ Parallel machines scheduling with machine maintenance for minsum criteria ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints ⋮ Scheduling on same-speed processors with at most one downtime on each machine ⋮ Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time ⋮ Single machine scheduling with small operator-non-availability periods ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ 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 ⋮ Minimizing the makespan for the flow shop scheduling problem with availability constraints. ⋮ Single machine scheduling with semi-resumable machine availability constraints ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Single machine scheduling under potential disruption ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals ⋮ 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 ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ 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 ⋮ Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities ⋮ Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance ⋮ Bounding strategies for the hybrid flow shop scheduling problem ⋮ A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint ⋮ Scheduling with tool changes to minimize total completion time: Basic results and SPT performance ⋮ A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times ⋮ Scheduling jobs under increasing linear machine maintenance time ⋮ Preemptive scheduling with availability constraints to minimize total weighted completion times ⋮ Bi-objective ant colony optimization approach to optimize production and maintenance scheduling ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Scheduling two-stage hybrid flow shop with availability constraints ⋮ An optimal semi-online algorithm for 2-machine scheduling with an availability constraint ⋮ A note on minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time ⋮ Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Optimization of processing and delivery decisions involving third-party machines ⋮ Single-machine scheduling problems with machine aging effect and an optional maintenance activity ⋮ Single-machine scheduling with job-dependent machine deterioration ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ Makespan minimization for parallel machines scheduling with multiple availability constraints ⋮ The coordination of single-machine scheduling with availability constraints and delivery ⋮ Minimizing the sum of job completion times on capacitated two-parallel machines ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Approximation algorithms for single machine scheduling with one unavailability period ⋮ Exponential inapproximability and FPTAS for scheduling with availability constraints ⋮ Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times ⋮ A branch and bound algorithm for optimal television commercial scheduling ⋮ Production, maintenance and resource scheduling: a review ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Heuristics for two-machine no-wait flowshop scheduling with an availability constraint ⋮ Minimizing makespan on parallel machines subject to release dates and delivery times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- Parallel machines scheduling with nonsimultaneous machine available time
- Single machine flow-time scheduling with scheduled maintenance
- Single machine flow-time scheduling with a single breakdown
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- NP-complete scheduling problems
- A lower bound for randomized on-line scheduling algorithms
- Minimizing the sum of job completion times on capacitated parallel machines
- Nearly on line scheduling of preemptive independent tasks
- Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Current trends in deterministic scheduling
- Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Scheduling with Deadlines and Loss Functions
- Fault-tolerant scheduling
- Optimal two- and three-stage production schedules with setup times included
- Scheduling on semi-identical processors
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Flat Graphs
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Stochastic Scheduling with Variable Profile and Precedence Constraints
- Some simple scheduling algorithms
- Reducibility among Combinatorial Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Bounds on Multiprocessing Timing Anomalies
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Fault-tolerant real-time scheduling
- Two-machine flow shops with limited machine availability
