Makespan minimization for parallel machines scheduling with multiple availability constraints
type: Item
instance of: scholarly article
title: Makespan minimization for parallel machines scheduling with multiple availability constraints
zbMATH Open document ID: 1296.90048
author: Navid Hashemian
author: C. Diallo
author: B. Vizvári
published in: Annals of Operations Research
publication date: 2014-09-26T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6347871
zbMATH Keywords: parallel machines
zbMATH Keywords: availability constraints
zbMATH Keywords: makespan
zbMATH Keywords: scheduling
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10479-012-1059-8
OpenAlex ID: W2005299742
cites work: Scheduling preemptable tasks on parallel processors with limited availability
cites work: Q4880190
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q4865763
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Machine scheduling with an availability constraint
cites work: Current trends in deterministic scheduling
cites work: Makespan minimization for two parallel machines with an availability constraint
cites work: Parallel machine scheduling with machine availability and eligibility constraints
cites work: Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
cites work: Scheduling with limited machine availability
DOI: 10.1007/S10479-012-1059-8
Recommended article: Makespan minimization for two parallel machines with an availability constraint
Recommended article: Makespan minimization for two parallel machines scheduling with a periodic availability constraint
Recommended article: Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
Recommended article: Parallel machine makespan minimization subject to machine availability and total completion time constraints
Recommended article: Makespan Minimization with Machine Availability Constraints
Recommended article: MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
Recommended article: Optimal parallel machines scheduling with availability constraints
Recommended article: Minimizing makespan for two parallel machines with job limit on each availability interval
Recommended article: Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints
Recommended article: Approximation schemes for parallel machine scheduling with availability constraints
description: scientific article; zbMATH DE number 6347871