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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 258; H. 2; S. 478 - 490
Hauptverfasser:	Wang, Jun-Qiang, Fan, Guo-Qiang, Zhang, Yingqian, Zhang, Cheng-Wu, Leung, Joseph Y.-T.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.04.2017
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!