Machine scheduling with a maintenance interval and job delivery coordination
From MaRDI portal
Publication:518131
DOI10.1007/s11590-015-0939-7zbMath1365.90139OpenAlexW1148679896MaRDI QIDQ518131
Weitian Tong, Jianming Dong, Randy Goebel, Jueliang Hu, Xiaotong Su, Taibo Luo, Yin-Feng Xu, Guo-Hui Lin
Publication date: 28 March 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0939-7
schedulingapproximation algorithmmachine maintenancebin-packingworst-case performance analysisjob delivery
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
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