A NEW DYNAMIC-PROGRAMMING FORMULATION OF (NXM) FLOWSHOP SEQUENCING PROBLEMS WITH DUE-DATES

Authors
SONMEZ AI BAYKASOGLU A
Citation
Ai. Sonmez et A. Baykasoglu, A NEW DYNAMIC-PROGRAMMING FORMULATION OF (NXM) FLOWSHOP SEQUENCING PROBLEMS WITH DUE-DATES, International Journal of Production Research, 36(8), 1998, pp. 2269-2283
Citations number
10
Categorie Soggetti
Engineering,"Operatione Research & Management Science
Journal title
International Journal of Production Research → ACNP
ISSN journal
00207543
Volume
36
Issue
8
Year of publication
1998
Pages
2269 - 2283
Database
ISI
SICI code
0020-7543(1998)36:8<2269:ANDFO(>2.0.ZU;2-X
Abstract
A dynamic programming formulation is presented for determining an opti mal solution to a problem where n jobs are to be sequenced in a multi- stage production environment. An application of a developed formulatio n to a plastic pipe manufacturing factory is also presented. Condition s are such that the job sequence is the same in all stages, each job r equires setups at each stage and setup times are sequence dependent. A n optimal solution is such that the minimum total tardiness is achieve d. A listing of the developed computer program is also provided.