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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 258; číslo 2; s. 478 - 490
Hlavní autori:	Wang, Jun-Qiang, Fan, Guo-Qiang, Zhang, Yingqian, Zhang, Cheng-Wu, Leung, Joseph Y.-T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.04.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!