Similar Search Results

Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization

Zhang, Han; Li, Kai; Jia, Zhao-hong; Chu, Chengbin - In: European journal of operational research : EJOR 309 (2023) 3, pp. 1024-1046

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

Scheduling deteriorating jobs with past-sequence-dependent delivery times

Liu, Ming; Wang, Shijin; Chu, Chengbin - In: International journal of production economics 144 (2013) 2, pp. 418-421

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

Coke production scheduling problem : a parallel machine scheduling with batch preprocessings and location-dependent processing times

Liu, Ming; Chu, Feng; He, Junkai; Yang, Dapeng; Chu, … - In: Computers & operations research : and their … 104 (2019), pp. 37-48

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

Energy-oriented bi-objective optimization for the tempered glass scheduling

Liu, Ming; Yang, Xuenan; Chu, Feng; Zhang, Jiantong; … - In: Omega : the international journal of management science 90 (2020), pp. 1-21

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

Scheduling robotic cells with fixed processing times or time windows : classification, solution approaches, polynomial algorithms and complexity

Feng, Jianguang; Che, Ada; Chu, Chengbin; Levner, Eugene; … - In: European journal of operational research : EJOR 319 (2024) 2, pp. 468-483

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

Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem

Zheng, Shuang; He, Zhengwen; Yang, Zhen; Chu, Chengbin; … - In: Computers & operations research : and their … 153 (2023), pp. 1-19

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

Time-flexible min completion time variance in a single machine by quadratic programming

Nasini, Stefano; Nessah, Rabia - In: European journal of operational research : EJOR 312 (2024) 2, pp. 427-444

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

An almost exact solution to the min completion time variance in a single machine

Nasini, Stefano; Nessah, Rabia - In: European journal of operational research : EJOR 294 (2021) 2, pp. 427-441

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

A Lower Bound for the Weighted Completion Time Variance Problem

Nessah, Rabia; Chu, Chengbin - IÉSEG School of Management, Université Catholique de Lille - 2008

We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than...

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

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

Nessah, Rabia; Kacem, Imed - IÉSEG School of Management, Université Catholique de Lille - 2009

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