Equal Processing Time Bicriteria Scheduling on Parallel Machines

Subhash C. Sarin and Divya Prakash
Additional contact information
Subhash C. Sarin: Virginia Tech, Blacksburg
Divya Prakash: Virginia Tech, Blacksburg

Journal of Combinatorial Optimization, 2004, vol. 8, issue 3, No 1, 227-240

Abstract: Abstract We consider the problem of scheduling jobs on parallel, identical machines so as to minimize a primary and a secondary criteria. All the jobs are assumed to have identical processing times. Polynomial time algorithms, that generate optimal solutions, are presented for various combinations of primary and secondary criteria.

Keywords: bicriteria scheduling; parallel machines; equal processing time jobs (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000038909.06086.ed Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038909.06086.ed

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000038909.06086.ed

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().