A dynamic programming formulation for the one machine sequencing problem

P.J. Weeda

Research output: Contribution to journalArticleAcademic

5 Citations (Scopus)

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.
Original languageUndefined
Pages (from-to)298-300
JournalEuropean journal of operational research
Volume2
Issue number4
DOIs
Publication statusPublished - 1978
Externally publishedYes

Keywords

  • IR-68437

Cite this