Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Chia-Shin Chung"'
Publikováno v:
Journal of Entrepreneurship, Management and Innovation, Vol 8, Iss 2, Pp 26-43 (2012)
The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20.
Externí odkaz:
https://doaj.org/article/f931c9c91a884419a6f945ad1d3dcc73
Publikováno v:
Journal of Software Engineering and Applications. :621-629
The general m-machine permutation flowshop problem with the total flow-time objective is known to be NP-hard for m ≥ 2. The only practical method for finding optimal solutions has been branch-and-bound algorithms. In this paper, we present an impro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e86c57768ef2fae23aba8c394d3d46d7
https://doi.org/10.4236/jsea.2012.58071
https://doi.org/10.4236/jsea.2012.58071
Autor:
Chia-Shin Chung, Flynn, James
Publikováno v:
Operations Research. Sep/Oct95, Vol. 43 Issue 5, p826. 12p. 7 Charts.
Autor:
Chia-Shin Chung1,2, Chien-Hua Mike Lin1,2
Publikováno v:
Management Science. Mar88, Vol. 34 Issue 3, p420-426. 7p.
Publikováno v:
European Journal of Operational Research. 198:148-156
Consider a retailer stocking a seasonal item facing a stochastic demand where information about the demand becomes more accurate as the selling season progresses. The retailer places orders before the start of the season and in-season reorders are no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3b0d93981a715e8fb49f6113f1baf70
https://doi.org/10.1016/j.ejor.2007.10.067
https://doi.org/10.1016/j.ejor.2007.10.067
Publikováno v:
European Journal of Operational Research. 188:775-792
Given items with short life cycles or seasonal demands, one can potentially improve profits by producing during the selling season, especially when its production capacity is substantial. We develop a two-stage, multi-item model incorporating reactiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5299929d52a1c990b22d99349bd33db1
https://doi.org/10.1016/j.ejor.2007.05.011
https://doi.org/10.1016/j.ejor.2007.05.011
Publikováno v:
European Journal of Operational Research. 178:767-781
Consider the expected profit maximizing inventory placement problem in an N-stage, supply chain facing a stochastic demand for a single planning period for a specialty item with a very short selling season. Each stage is a stocking point holding some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f571a7edc6b8f562109fde62e8a9fc0
https://doi.org/10.1016/j.ejor.2006.01.040
https://doi.org/10.1016/j.ejor.2006.01.040
Publikováno v:
European Journal of Operational Research. 174:1-10
The m -machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4366395f1d33f189c19275254ae9789b
https://doi.org/10.1016/j.ejor.2004.12.023
https://doi.org/10.1016/j.ejor.2004.12.023
Publikováno v:
Zeitschrift fur Betriebswirtschaft, 76(2), 177-198. Springer International Publishing AG
In this paper a basic model for analyzing the inventory placement problem in a supply chain is developed. The problem will be studied for a capacitated, multi-stage supply chain facing a continuous, stochastic demand for a single period for a single
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f968d5be6e15743039e8fc7ed3cdc0a5
https://doi.org/10.1007/s11573-006-0005-0
https://doi.org/10.1007/s11573-006-0005-0
Autor:
James Flynn, Chia-Shin Chung
Publikováno v:
Computers & Operations Research. 31:1335-1348
This article presents a heuristic algorithm for determining replacement policies in a discrete-time, infinite-horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52c68bdac33bc175ccc51b4f07f90633
https://doi.org/10.1016/s0305-0548(03)00094-7
https://doi.org/10.1016/s0305-0548(03)00094-7