Title of article
A note on a due-date assignment on a two-machine flow-shop
Author/Authors
Motty Birman، نويسنده , , Gur Mosheiov، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
8
From page
473
To page
480
Abstract
We address a due-date assignment and scheduling problem in a two-machine flow-shop setting. Our objective is to find both the job schedule and the common due-date which minimize maximum earliness, tardiness and due-date costs. We introduce an efficient View the MathML source solution, based on repetitive use of the well-known Johnson Algorithm.
Keywords
Scheduling , Earliness-tardiness , Flow-shop , Due-date assignment
Journal title
Computers and Operations Research
Serial Year
2004
Journal title
Computers and Operations Research
Record number
928032
Link To Document