Parallel machine scheduling problems considering regular measures of performance and machine cost

From MaRDI portal

Revision as of 02:52, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3582663

Jump to:navigation, search

DOI10.1057/jors.2009.38zbMath1193.90208OpenAlexW2078131788MaRDI QIDQ3582663

No author found.

Publication date: 2 September 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.2009.38

zbMATH Keywords

scheduling parallel machines Pareto solutions machine utilization multi-objective criteria

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (3)

Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost ⋮ Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence ⋮ Scheduling unrelated parallel machines with optional machines and jobs selection

This page was built for publication: Parallel machine scheduling problems considering regular measures of performance and machine cost

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3582663&oldid=16988065"