Machine Scheduling with a Maintenance Interval and Job Delivery Coordination

DOI10.1007/978-3-319-19647-3_10zbMath1356.90056OpenAlexW3037924221MaRDI QIDQ3452556

Taibo Luo, Guo-Hui Lin, Xiaotong Su, Randy Goebel, Weitian Tong, Jianming Dong, Jueliang Hu, Yin-Feng Xu

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_10

zbMATH Keywords

schedulingapproximation algorithmmachine maintenancebin-packingworst-case performance analysisjob delivery

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items

Scheduling with job delivery coordination on single machine

Cites Work

• Unnamed Item
• Improved algorithms for two single machine scheduling problems
• On the machine scheduling problem with job delivery coordination
• A 71/60 theorem for bin packing
• Current trends in deterministic scheduling
• Machine scheduling with job delivery coordination
• Machine scheduling with an availability constraint and job delivery coordination
• SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
• Machine scheduling with transportation considerations