|
|||||
|
|
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date |
|
| Authors: | Celso S Sakuraba Débora P Ronconi Francis Sourd |
| Affiliation: | 1. Departamento de Engenharia de Produção, EPUSP, Universidade de São Paulo, Av. Prof. Almeida Prado, 128, Cidade Universitária, 05508-900, São Paulo SP, Brazil;2. Lab. LIP6, Université Pierre et Marie Curie, Case Courier 169, 4, Place Jussieu, 75252 Paris, Cedex 05, France |
| Abstract: | This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule for a given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs. |
| Keywords: | Scheduling Earliness and tardiness Common due date Flowshop Heuristics |
| 本文献已被 ScienceDirect 等数据库收录！ | |
