Makespan minimization for two parallel machines with an availability constraint
type: Item
instance of: scholarly article
title: Makespan minimization for two parallel machines with an availability constraint
zbMATH Open document ID: 1067.90046
author: Ching-Jong Liao
author: Der-Lin Shyur
author: Chien-Hung Lin
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 2117516
zbMATH Keywords: Scheduling
zbMATH Keywords: Parallel machine
zbMATH Keywords: Availability constraint
zbMATH Keywords: Makespan minimization
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.08.034
OpenAlex ID: W2048135710
cites work: Q4865763
cites work: Parallel machines scheduling with nonsimultaneous machine available time
cites work: Machine scheduling with an availability constraint
cites work: Two-machine flowshop scheduling with availability constraints
cites work: Scheduling jobs and maintenance activities on parallel machines
cites work: A note on ''parallel machine scheduling with non-simultaneous machine available time''
cites work: Current trends in deterministic scheduling
cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times
cites work: Q4055377
cites work: Minimizing the sum of job completion times on capacitated parallel machines
cites work: Q3525911
cites work: Scheduling on semi-identical processors
cites work: Scheduling Independent Tasks with Deadlines on Semi-identical Processors
cites work: Scheduling with limited machine availability
DOI: 10.1016/J.EJOR.2003.08.034
description: scientific article; zbMATH DE number 2117516