Earliness–tardiness scheduling with setup considerations |
| |
| Affiliation: | 1. Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, Rua do Matão, 1010, Cidade Universitária, São Paulo, 05508-090, SP, Brazil;2. Department of Production Engineering, Polytechnic School, University of São Paulo, Av. Prof. Luciano Gualberto, 1380, Cidade Universitária, São Paulo, 05508-010 SP, Brazil;1. Systems Research Institute, Polish Academy of Sciences, Newelska 6, Warsaw 01-447, Poland;2. The International University of Logistics and Transport in Wroc?aw, So?tysowicka St. 19B, Wroc?aw 51-168, Poland |
| |
| Abstract: | The one-machine scheduling problem with sequence-dependent setup times and costs and earliness–tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
