Minimizing makespan subject to minimum flowtime on two identical parallel machines

DOI10.1016/S0305-0548(99)00083-0zbMath0990.90039WikidataQ126862922 ScholiaQ126862922MaRDI QIDQ5939974

Jatinder N. D. Gupta, Johnny C. Ho

Publication date: 26 August 2002

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

zbMATH Keywords

empirical resultsflowtime minimizationhierarchical criteriamakespan minimizationparallel machine scheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Makespan minimization subject to flowtime optimality on identical parallel machines ⋮ Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Scheduling parallel CNC machines with time/cost trade-off considerations ⋮ Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for the subset-sum problem: Survey and experimental analysis
• Multiple and bicriteria scheduling: A literature survey
• Algorithms minimizing mean flow time: Schedule-length properties
• Complexity of single machine, multi-criteria scheduling problems
• Minimizing Schedule Length Subject to Minimum Flow Time
• An Application of Bin-Packing to Multiprocessor Scheduling
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Minimizing makespan subject to minimum flowtime on two identical parallel machines