An Efficient Algorithm for a Bicriteria Single-Machine Scheduling Problem

2952 22 2992 3 5944 document 2992 WP-87-100.pdf application/pdf e29ae5fde0e681578becc9402248f948 MD5 426901 2016-01-15 01:57:45 https://pure.iiasa.ac.at/id/eprint/2952/1/WP-87-100.pdf 2952 1 1 text en public

WP-87-100.pdf

22 0cedd7b897e0bb7676d948370f9b0729a53895e3 18746 2 30476 document 18746 lightbox.jpg image/png b30f4db819e9e937b43b40feaf858f1b MD5 12249 2016-01-15 13:26:14 https://pure.iiasa.ac.at/id/eprint/2952/2/lightbox.jpg 2952 2 2 image/png other Thumbnails conversion from text to thumbnail_lightbox en public

lightbox.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/islightboxThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2992 18747 2 30477 document 18747 preview.jpg image/png 315b92082d8eeb13b1c8a848ff596739 MD5 5963 2016-01-15 13:26:15 https://pure.iiasa.ac.at/id/eprint/2952/3/preview.jpg 2952 3 3 image/png other Thumbnails conversion from text to thumbnail_preview en public

preview.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/ispreviewThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2992 18748 2 30478 document 18748 medium.jpg image/png 59c487dad5eaefb4c4ea8d459fa561a7 MD5 2456 2016-01-15 13:26:16 https://pure.iiasa.ac.at/id/eprint/2952/4/medium.jpg 2952 4 4 image/png other Thumbnails conversion from text to thumbnail_medium en public

medium.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/ismediumThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2992 18749 2 30479 document 18749 small.jpg image/png 9c2faa73c4cbd4a9a015c6c81381f2b4 MD5 1087 2016-01-15 13:26:17 https://pure.iiasa.ac.at/id/eprint/2952/5/small.jpg 2952 5 5 image/png other Thumbnails conversion from text to thumbnail_small en public

small.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/issmallThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2992 18754 1 30484 document 18754 indexcodes.txt text/x-pascal 6c090182adec5a8e66dcaadb4bd05c59 MD5 5621 2016-01-15 13:26:24 https://pure.iiasa.ac.at/id/eprint/2952/6/indexcodes.txt 2952 6 6 text/x-pascal other Generate index codes conversion from text to indexcodes en public

indexcodes.txt

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isIndexCodesVersionOf https://pure.iiasa.ac.at/id/document/2992 82122 2 230428 document 82122 WP-87-100.pdf application/pdf 0817724308bac32be9e21202db13a237 MD5 1120317 2018-03-14 08:17:00 https://pure.iiasa.ac.at/id/eprint/2952/7/WP-87-100.pdf 2952 7 7 application/pdf other Coversheet version en public

WP-87-100.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2992 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/2992 archive 351 disk0/00/00/29/52 2016-01-15 01:57:45 2021-08-27 17:12:56 2016-01-15 01:57:45 monograph show 2 Katoh N. AL0823 An Efficient Algorithm for a Bicriteria Single-Machine Scheduling Problem pub iis_met prog_sds This paper considers a single-machine scheduling problem in which the maximum tardiness and the total flowtime are two objectives to be minimized. Instead of enumerating all efficient schedules, the author considers the problem of minimizing the maximum of the weighted values of these two objective functions, which arises in interactive multicriteria decision making. The author proposes a strongly polynomial algorithm for this problem which runs in O(n^2 log n) time. 1987-10 published WP-87-100 WP-87-100 10 2015 public working_paper IIASA, Laxenburg, Austria 15 FALSE info:eu-repo/semantics/book