Minimizing flowtime subject to optimal makespan on two identical parallel machines

DOI10.1590/S0101-74382000000100003zbMath1181.90116OpenAlexW2030821376MaRDI QIDQ5189089

Johnny C. Ho, Jatinder N. D. Gupta

Publication date: 6 March 2010

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s0101-74382000000100003

zbMATH Keywords

flowtime minimizationhierarchical criteriaparallel machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple and bicriteria scheduling: A literature survey
• Complexity of single machine, multi-criteria scheduling problems
• Scheduling with Deadlines and Loss Functions
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Scheduling independent tasks to reduce mean finishing time

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