Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan

Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

(2019) Jun Pei et al.   ANNALS OF OPERATIONS RESEARCH

A note on unbounded parallel-batch scheduling

(2015) Zhichao Geng et al.   INFORMATION PROCESSING LETTERS

A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives

(2013) Qi Feng et al.   APPLIED MATHEMATICAL MODELLING

Bounded parallel-batching scheduling with two competing agents

(2012) B. Q. Fan et al.   JOURNAL OF SCHEDULING

Unbounded parallel-batching scheduling with two competitive agents

(2011) Shisheng Li et al.   JOURNAL OF SCHEDULING

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

(2010) CHENG HE et al.   ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH

Optimal methods for batch processing problem with makespan and maximum lateness objectives

(2009) M.T. Yazdani Sabouni et al.   APPLIED MATHEMATICAL MODELLING

Bicriterion scheduling with equal processing times on a batch processing machine

(2007) L.L. Liu et al.   COMPUTERS & OPERATIONS RESEARCH