Makespan minimization for two parallel machines with an availability constraint
From MaRDI portal
Recommendations
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Minimizing makespan for two parallel machines with job limit on each availability interval
- Two-machine scheduling with periodic availability constraints to minimize makespan
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 849179 (Why is no real title available?)
- A note on parallel machine scheduling with non-simultaneous machine available time
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Current trends in deterministic scheduling
- Machine scheduling with an availability constraint
- Minimizing the sum of job completion times on capacitated parallel machines
- Parallel machines scheduling with nonsimultaneous machine available time
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Scheduling jobs and maintenance activities on parallel machines
- Scheduling on semi-identical processors
- Scheduling with limited machine availability
- Two-machine flowshop scheduling with availability constraints
Cited in
(25)- Order acceptance and two parallel machines scheduling problem with an availability constraint
- A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach
- Makespan Minimization with Machine Availability Constraints
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Scheduling jobs with maintenance subject to load-dependent duration on a single machine
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Approximation algorithms for scheduling with reservations
- The effect of machine availability on the worst-case performance of LPT
- Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
- Production-driven opportunistic maintenance for batch production based on MAM-APB scheduling
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
- Minimizing makespan for two parallel machines with job limit on each availability interval
- Online and semi-online scheduling on capacitated two-parallel machines
- Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate
- Scheduling two parallel machines with machine-dependent availabilities
- Minimizing flowtime subject to optimal makespan on two identical parallel machines
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Two-machine scheduling with periodic availability constraints to minimize makespan
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
This page was built for publication: Makespan minimization for two parallel machines with an availability constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887910)
