Maximizing Total Profit in the Relocation Project with Generalized Due Dates
碩士 === 國立暨南國際大學 === 資訊管理學系 === 92 === The relocation problem, originated from a housing project in Boston area, is a generalized resource-constrained scheduling problem in which the capacity of a building after the redevelopment is not necessarily the same as that before the project started. In this...
Main Authors: | Ssz Ting Liu, 劉思廷 |
---|---|
Other Authors: | B.M.T. Lin |
Format: | Others |
Language: | zh-TW |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/85742656043645403769 |
Similar Items
-
Minimizing the Makespan in the Relocation Project with Arbitrary Release Date
by: Chuang, Fu-Yen, et al.
Published: (2014) -
Simulated Annealing Heuristics for the Resource constrained Project Scheduling Problem to Maximize Profit within a Specified Deadline
by: Sih - Huei Wu, et al.
Published: (2007) -
Two-agent scheduling with generalized due dates
by: Myoung-Ju Park, et al.
Published: (2018-12-01) -
Coordinating supply chain with complementary suppliers and composite contract for maximizing total profit
by: Tai-Yu Kuo, et al.
Published: (2012) -
Optimizing the use of dedicated and contract transportation assets to maximize total system profit
by: Lee, Tae Whee, et al.
Published: (2008)