PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION

DOI10.1017/S1446181117000190zbMath1373.90053MaRDI QIDQ5370785

No author found.

Publication date: 20 October 2017

Published in: The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

schedulingapproximation algorithmbin packingjob delivery

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Coordinated scheduling of the outsourcing, in-house production and distribution operations

Cites Work

• Unnamed Item
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• Improved algorithms for two single machine scheduling problems
• On the machine scheduling problem with job delivery coordination
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Machine scheduling with job delivery coordination
• SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION