Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Kuei-Tang Fang"'
Publikováno v:
International Journal of Operations Research, Vol 13, Iss 3, Pp 102-120 (2016)
One of the commercial Internet applications is banner advertisement, which is also the major source of income for portal websites. Limited research works address the issues of efficiently scheduling advertisement requests into available advertiseme
Externí odkaz:
https://doaj.org/article/a9abd3a54453400a918c20bd95032a26
Publikováno v:
Discrete Optimization. 17:69-79
This paper investigates a single-machine scheduling problem with a set of supporting tasks and a set of jobs. Each job is preceded by a subset of supporting tasks, that is, the job cannot start its processing until all of its supporting tasks are fin
Publikováno v:
Engineering Optimization. 45:1397-1408
This article considers a differentiation flow-shop model, where the jobs are divided into various categories, each of which consists of two stages of operations. All products should be processed first on the single common machine at stage 1. At the s
Autor:
Bertrand M.T. Lin, Kuei-Tang Fang
Publikováno v:
Computers & Industrial Engineering. 64:224-234
Traditional research on machine scheduling focuses on job allocation and sequencing to optimize certain objective functions that are defined in terms of job completion times. With regard to environmental concerns, energy consumption becomes another c
Publikováno v:
International Journal of Production Economics. 141:286-294
This paper studies a two-machine flow shop scheduling problem with a supporting precedence relation. The model originates from a real production context of a chemical factory that produces foam-rubber products. We extend the traditional two-machine f