Similar Search Results

Improved algorithms for single machine scheduling with release dates and rejections

He, Cheng; Leung, Joseph Y-T.; Lee, Kangbok; Pinedo, Michael - In: 4OR : a quarterly journal of operations research 14 (2016) 1, pp. 41-55

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

Ideal schedules in parallel machine settings

Jiang, Xiaojuan; Lee, Kangbok; Pinedo, Michael - In: European journal of operational research : EJOR 290 (2021) 2, pp. 422-434

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

An iterated greedy matheuristic for scheduling in steelmaking-continuous casting process

Hong, Juntaek; Moon, Kyungduk; Lee, Kangbok; Lee, Kwansoo; … - In: International journal of production research 60 (2022) 2, pp. 623-643

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

Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

Jiang, Xiaojuan; Lee, Kangbok; Pinedo, Michael - In: European journal of operational research : EJOR 305 (2023) 2, pp. 594-607

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

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

Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines

Zhang, Han; Jia, Zhao-hong; Li, Kai - In: Computers & operations research : and their … 117 (2020), pp. 1-19

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

A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES

JIAO, CHENGWEN; LI, WENHUA; YUAN, JINJIANG - In: Asia-Pacific Journal of Operational Research (APJOR) 31 (2014) 04, pp. 1450030-1

We consider online scheduling of unit length jobs on m identical parallel-batch machines. Jobs arrive over time. The objective is to minimize maximum flow-time, with the flow-time of a job being the difference of its completion time and its release time. A parallel-batch machine can handle up to...

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

Approximation algorithms for batch scheduling with processing set restrictions

Chai, Xing; Li, Wenhua; Ng, C. T.; Cheng, T. C. E. - In: Journal of scheduling : JOS 26 (2023) 6, pp. 523-533

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

Handbook of scheduling : algorithms, models, and performance analysis

Leung, Joseph Y-T. (contributor) - 2004

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

Scheduling with processing set restrictions : a literature update

Leung, Joseph Y-T.; Li, Chung-Lun - In: International journal of production economics 175 (2016), pp. 1-11

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