Scheduling reclaimer operations in the stockyard to minimize makespan

DOI10.1007/s10255-018-0758-6zbMath1401.90085OpenAlexW2886843308WikidataQ129382571 ScholiaQ129382571MaRDI QIDQ1782041

Chao Wang, Xi-wen Lu, R. A. Sitters

Publication date: 18 September 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/ws/files/120340186/Wang2018_SchedulingReclaimerOperationsInTheStockyardToMinimizeMakespan.pdf

zbMATH Keywords

schedulingapproximation algorithmnumerical simulationperformance ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A reclaimer scheduling problem arising in coal stockyard management
• Crane scheduling in container yards with inter-crane interference
• A note on graph balancing problems with restrictions
• Approximation schemes for scheduling on parallel machines
• A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• Graph balancing: a special case of scheduling unrelated parallel machines
• `` Strong NP-Completeness Results
• Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
• Approximation of Optimal Moving Paths of Huge Robot Reclaimer with a 3D Range Finder