Machine scheduling with availability constraints

DOI10.1007/S002360050143zbMath0917.68018OpenAlexW1980096819MaRDI QIDQ1284696

Eric Sanlaville, Günter Schmidt

Publication date: 13 June 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050143

zbMATH Keywords

schedulingNP-hardness

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (51)

Approximation schemes for scheduling a maintenance and linear deteriorating jobs ⋮ Approximation algorithms for the single-machine scheduling with a period of maintenance ⋮ Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs ⋮ An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints ⋮ 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 ⋮ Single-machine scheduling with resource-dependent processing times and multiple unavailability periods ⋮ Scheduling jobs in open shops with limited machine availability ⋮ Heuristics for two-machine flowshop scheduling with setup times and an availability constraint ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Integrated production scheduling and maintenance policy for robustness in a single machine ⋮ 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 ⋮ An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration ⋮ Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint ⋮ Scheduling on same-speed processors with at most one downtime on each machine ⋮ Fault tolerant scheduling of tasks of two sizes under resource augmentation ⋮ Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times ⋮ ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES ⋮ 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 ⋮ Skilled workforce scheduling in service centres ⋮ Scheduling on uniform processors with at most one downtime on each machine ⋮ Online scheduling on semi-related machines ⋮ Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance ⋮ Scheduling with unexpected machine breakdowns ⋮ Scheduling jobs under increasing linear machine maintenance time ⋮ Preemptive scheduling with availability constraints to minimize total weighted completion times ⋮ 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 ⋮ Two-machine open shop scheduling with an availability constraint ⋮ 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 ⋮ Solving an integrated job-shop problem with human resource constraints ⋮ 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 ⋮ Exponential inapproximability and FPTAS for scheduling with availability constraints ⋮ Optimality of Jackson's permutations with respect to limited machine availability ⋮ Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times ⋮ Scheduling interfering job sets on parallel machines ⋮ Machine scheduling with a rate-modifying activity ⋮ Heuristics for two-machine no-wait flowshop scheduling with an availability constraint

This page was built for publication: Machine scheduling with availability constraints