Scheduling with flexible resources in parallel workcenters to minimize maximum completion time

DOI10.1016/j.cor.2005.02.042zbMath1102.90027OpenAlexW2126935771MaRDI QIDQ850309

Alex J. Ruiz-Torres, Grisselle Centeno

Publication date: 15 November 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.042

zbMATH Keywords

makespanmaximum completion timeparallel machines schedulingdual resource scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs, Collaborative Operating Room Planning and Scheduling, Minimizing the number of late jobs for the permutation flowshop problem with secondary resources, Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility, Production, maintenance and resource scheduling: a review, Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Unnamed Item
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• The impact of resource flexibility and staffing decisions on cellular and departmental shop performance
• Makespan minimization on uniform parallel machines with release times
• A Generalized Uniform Processor System
• An Application of Bin-Packing to Multiprocessor Scheduling
• Scheduling Parallel Manufacturing Cells with Resource Flexibility