Similar Search Results

Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences

Cheng, T. C. E.; Kravčenko, Svetlana A.; Lin, Bertrand … - In: Journal of the Operational Research Society 72 (2021) 10, pp. 2286-2289

Persistent link: https://www.econbiz.de/10012653161

Two-machine hybrid flowshop scheduling with identical jobs : solution algorithms and analysis of hybrid benefits

Wei, Qi; Wu, Yong; Jiang, Yiwei; Cheng, T. C. E. - In: Journal of the Operational Research Society 70 (2019) 5, pp. 817-826

Persistent link: https://www.econbiz.de/10012212980

RFID investment strategy for fresh food supply chains

Fu, Na; Cheng, T. C. E.; Tian, Zhongjun - In: Journal of the Operational Research Society 70 (2019) 9, pp. 1475-1489

Persistent link: https://www.econbiz.de/10012214263

Bidding for outsourcing contracts with capacity investments and cost asymmetry

Jain, Tarun; Hazra, Jishnu; Cheng, T. C. E. - In: Journal of the Operational Research Society 71 (2020) 12, pp. 1986-2012

Persistent link: https://www.econbiz.de/10012314418

On scheduling of step-improving jobs to minimize the total weighted completion time

Cheng, T. C. E.; Kravčenko, Svetlana A.; Lin, Bertrand … - In: Journal of the Operational Research Society 75 (2024) 4, pp. 720-730

Persistent link: https://www.econbiz.de/10014555748

New product design decisions and free sharing of patents with rivals

Jain, Tarun; Hazra, Jishnu; Cheng, T. C. E. - In: Journal of the Operational Research Society 74 (2023) 1, pp. 59-80

Persistent link: https://www.econbiz.de/10014231639

Online hierarchical parallel-machine scheduling in shared manufacturing to minimize the total completion time

Wei, Qi; Wu, Yong; Cheng, T. C. E.; Sun, Fengxin; … - In: Journal of the Operational Research Society 74 (2023) 11, pp. 2432-2454

Persistent link: https://www.econbiz.de/10014446152

A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines

Ng, Chi To; Cheng, Tai Chiu Edwin; Bandalouski, Andrei M; … - In: Journal of the Operational Research Society 65 (2014) 10, pp. 1571-1579

We study the problem of scheduling n non-preemptive jobs on m unrelated parallel machines. Each machine can process a specified subset of the jobs. If a job is assigned to a machine, then it occupies a specified time interval on the machine. Each assignment of a job to a machine yields a value....

Persistent link: https://www.econbiz.de/10010959073