Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
type: Item
instance of: scholarly article
title: Scheduling with flexible resources in parallel workcenters to minimize maximum completion time
zbMATH Open document ID: 1102.90027
author: Alex J. Ruiz-Torres
author: Grisselle Centeno
published in: Computers \& Operations Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5072745
zbMATH Keywords: parallel machines scheduling
zbMATH Keywords: dual resource scheduling
zbMATH Keywords: makespan
zbMATH Keywords: maximum completion time
MaRDI profile type: Publication
full work available at URL: j.cor.2005.02.042
OpenAlex ID: W2126935771
cites work: Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
cites work: Scheduling Parallel Manufacturing Cells with Resource Flexibility
cites work: Scheduling problems for parallel dedicated machines under multiple resource constraints.
cites work: The impact of resource flexibility and staffing decisions on cellular and departmental shop performance
cites work: Makespan minimization on uniform parallel machines with release times
cites work: Q4198056
cites work: A Generalized Uniform Processor System
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT
DOI: 10.1016/J.COR.2005.02.042
description: scientific article; zbMATH DE number 5072745