Back to University of Twente portal
A dynamic programming formulation for the one machine sequencing problem
Weeda, P.J. (1978) A dynamic programming formulation for the one machine sequencing problem. European Journal of Operational Research, 2 (4). pp. 298-300. ISSN 0377-2217
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 214Kb |
| Abstract: | This note presents a dynamic programming formulation for the one machine sequencing problem. For each job the following are given:
1. (i) an arbitrary cost function of its completion time, 2. (ii) a processing time, 3. (iii) a set-up cost and a set-up time if this job is the first of the sequence.For each pair of jobs are given: 4. (iv) a change-over cost and a change-over time. This formulation contains two formulations of Held and Karp as special cases. |
| Item Type: | Article |
| Copyright: | © 1978 Elsevier Science |
| Link to this item: | http://purl.utwente.nl/publications/68437 |
| Official URL: | http://dx.doi.org/10.1016/0377-2217(78)90045-0 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page