Two parallel machines problem with job delivery coordination and availability constraint

DOI10.1007/s10479-015-1903-8zbMath1332.90116OpenAlexW2205442825MaRDI QIDQ256680

Jason Chao-Hsien Pan, Chi-Shiang Su

Publication date: 9 March 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1903-8

zbMATH Keywords

schedulingheuristicsupply chain managementcomplexity theory

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Machine scheduling with deliveries to multiple customer locations
• Makespan minimization for parallel machines scheduling with multiple availability constraints
• 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
• Single machine scheduling with batch deliveries
• Heuristics for parallel machine scheduling with delivery times
• Machine scheduling with job delivery coordination
• Complexity of flow shop scheduling problems with transportation constraints
• Scheduling with batching: A review
• Machine scheduling with an availability constraint and job delivery coordination
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Machine scheduling with transportation considerations

This page was built for publication: Two parallel machines problem with job delivery coordination and availability constraint