T
T.C.E. Cheng
Researcher at Hong Kong Polytechnic University
Publications - 804
Citations - 28601
T.C.E. Cheng is an academic researcher from Hong Kong Polytechnic University. The author has contributed to research in topics: Job shop scheduling & Scheduling (computing). The author has an hindex of 75, co-authored 719 publications receiving 24636 citations. Previous affiliations of T.C.E. Cheng include National University of Singapore & Beijing Jiaotong University.
Papers
More filters
Journal ArticleDOI
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
Journal ArticleDOI
Managing carbon footprints in inventory management
TL;DR: In this paper, the optimal order quantity was derived and the impacts of carbon trade, carbon price, and carbon cap on order decisions, carbon emissions, and total cost in inventory management.
Journal ArticleDOI
A concise survey of scheduling with time-dependent processing times
TL;DR: A framework is provided to illustrate how models for this class of machine scheduling problems have been generalized from the classical scheduling theory, and a complexity boundary is presented for each model.
Journal ArticleDOI
A state-of-the-art review of parallel-machine scheduling research
T.C.E. Cheng,C.C.S. Sin +1 more
TL;DR: The major research results in deterministic parallel-machine scheduling theory will pass a survey and it is revealed that there exist a lot of potential areas worthy of further research.
Journal ArticleDOI
Survey of scheduling research involving due date determination decisions
T.C.E. Cheng,Mahesh Gupta +1 more
TL;DR: A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.