Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

•We schedule two agents on a single p-batching machine with non-identical job sizes.•We minimize the makespan of one agent under a bounded makespan of the other agent.•We show that no polynomial-time algorithm with a finite bound exists, unless P = NP.•We propose an effective algorithm to obtain a l...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 258; no. 2; pp. 478 - 490
Main Authors:	Wang, Jun-Qiang, Fan, Guo-Qiang, Zhang, Yingqian, Zhang, Cheng-Wu, Leung, Joseph Y.-T.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.04.2017
Subjects:	Heuristics NP-hardness Parallel-batching machine Scheduling Two-agent scheduling NP-hardness Scheduling Heuristics Two-agent scheduling Parallel-batching machine
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!