Multiple common due dates | Zendy

Dickman Bernard | Zendy; Wilamowsky Yonah | Zendy; Epstein Sheldon | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Multiple common due dates

Author(s) -

Dickman Bernard,

Wilamowsky Yonah,

Epstein Sheldon

Publication year - 2001

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.9

Subject(s) - computer science , single machine scheduling , scheduling (production processes) , set (abstract data type) , due date , class (philosophy) , operations research , mathematical optimization , artificial intelligence , job shop scheduling , mathematics , computer network , programming language , routing (electronic design automation) , queue

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research