A note on efficient sequences with respect to total flow time and number of tardy jobs | Zendy

Güngör Murat | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A note on efficient sequences with respect to total flow time and number of tardy jobs

Author(s) -

Güngör Murat

Publication year - 2016

Publication title -

naval research logistics (nrl)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.665

H-Index - 68

eISSN - 1520-6750

pISSN - 0894-069X

DOI - 10.1002/nav.21694

Subject(s) - pairwise comparison , scheduling (production processes) , computer science , upper and lower bounds , due date , point (geometry) , mathematical optimization , mathematics , maximum flow problem , flow shop scheduling , operations research , job shop scheduling , artificial intelligence , schedule , mathematical analysis , geometry , operating system

For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research