Minimizing makespan subject to minimum total flow-time on identical parallel machines
type: Item
instance of: scholarly article
title: Minimizing makespan subject to minimum total flow-time on identical parallel machines
zbMATH Open document ID: 0952.90009
DOI: 10.1016/S0377-2217(99)00386-0
author: Jatinder N. D. Gupta
author: Alex J. Ruiz-Torres
published in: European Journal of Operational Research
publication date: 2000-09-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1507981
zbMATH Keywords: parallel-machine scheduling
zbMATH Keywords: hierarchical criteria
zbMATH Keywords: makespan
zbMATH Keywords: flow-time
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: empirical results
MaRDI profile type: Publication
cites work: An interactive procedure for bi-criteria production scheduling
cites work: Q4051615
cites work: Complexity of single machine, multi-criteria scheduling problems
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Algorithms minimizing mean flow time: Schedule-length properties
cites work: Q4658190
cites work: On the Minimization of the Makespan Subject to Flowtime Optimality
cites work: Evaluation of a MULTIFIT-based scheduling algorithm
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT
cites work: Complexity of single machine hierarchical scheduling: A survey
cites work: Multiple and bicriteria scheduling: A literature survey
cites work: Handbook of parametric and nonparametric statistical procedures
full work available at URL: s0377-2217(99)00386-0
OpenAlex ID: W2056052030
Recommended article: Makespan minimization subject to flowtime optimality on identical parallel machines
Recommended article: Minimizing makespan subject to minimum flowtime on two identical parallel machines
Recommended article: Minimizing flowtime subject to optimal makespan on two identical parallel machines
Recommended article: Minimizing makespan in parallel flowshops
Recommended article: On the minimization of total weighted flow time with identical and uniform parallel machines
Recommended article: Minimizing makespan with release times on identical parallel batching machines
Recommended article: Parallel Processing and Applied Mathematics
Recommended article: Parallel machine makespan minimization subject to machine availability and total completion time constraints
Recommended article: Exact makespan minimization of unrelated parallel machines
Recommended article: Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions
description: scientific article; zbMATH DE number 1507981