Two parallel machines scheduling with two-vehicle job delivery to minimize makespan

DOI10.1155/2020/1647401zbMath1435.90063OpenAlexW3003296896MaRDI QIDQ2296256

Jianhong Hao, Lisi Cao, Dakui Jiang

Publication date: 18 February 2020

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/1647401

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Two parallel machines problem with job delivery coordination and availability constraint
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• The coordination of scheduling and batch deliveries
• 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
• On-line integrated production-distribution scheduling problems with capacitated deliveries
• Scheduling with job delivery coordination on single machine
• Machine scheduling with job delivery coordination
• Integrated machine scheduling and vehicle routing with time windows
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Machine scheduling with an availability constraint and job delivery coordination
• Integrated Scheduling of Production and Distribution Operations

This page was built for publication: Two parallel machines scheduling with two-vehicle job delivery to minimize makespan