Search Results - subject:"batch processing machine"

Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system

Parsa, N. Rafiee; Karimi, B.; Husseini, S. M. Moattar - In: Computers & operations research : and their … 80 (2017), pp. 173-183

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

Multi objective dynamic real-time scheduling of batch processing machine

Vimalarani, M.; Mathirajan, M. - In: International journal of operations and quantitative … 22 (2016) 1, pp. 53-73

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

Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing

Jia, Wenyou; Jiang, Zhibin; Li, You - In: International journal of production research 53 (2015) 6, pp. 1866-1879

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

Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits

Abedi, Mehdi; Seidgar, Hany; Fazlollagtabar, Hamed; … - In: International journal of production research 53 (2015) 6, pp. 1680-1711

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

Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes

Zhou, Shengchao; Chen, Huaping; Xu, Rui; Li, Xueping - In: International journal of production research 52 (2014) 8, pp. 2258-2274

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

A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system

Xu, Rui; Chen, Huaping; Li, Xueping - In: International Journal of Production Economics 145 (2013) 1, pp. 371-386

This research aims to minimize the bi-criteria of makespan and maximum tardiness on a set of identical batch-processing machines arranged in parallel. Each machine can process multiple jobs simultaneously as long as the machine capacity is not exceeded. Each job is defined by its processing...

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

A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system

Xu, Rui; Chen, Huaping; Li, Xueping - In: International journal of production economics 145 (2013) 1, pp. 371-386

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

SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION

HE, CHENG; LIN, YIXUN; YUAN, JINJIANG - In: Asia-Pacific Journal of Operational Research (APJOR) 27 (2010) 05, pp. 577-585

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time....

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

Scheduling a batch processing machine with bipartite compatibility graphs

Boudhar, Mourad - In: Mathematical Methods of Operations Research 57 (2003) 3, pp. 513-527

We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible … compatibility graph), which is assumed to be bipartite. The capacity of the batch processing machine is equal to 2. Furthermore, the …

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

Scheduling a batch processing machine with bipartite compatibility graphs

Boudhar, Mourad - In: Computational Statistics 57 (2003) 3, pp. 513-527

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