Article ID: | iaor20043067 |
Country: | United Kingdom |
Volume: | 31 |
Issue: | 3 |
Start Page Number: | 473 |
End Page Number: | 480 |
Publication Date: | Mar 2004 |
Journal: | Computers and Operations Research |
Authors: | Mosheiov Gur, Birman Motty |
Keywords: | flowshop |
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 (O(