FPTAS for the two identical parallel machine problem with a single operator under the free changing mode

DOI10.1016/j.ejor.2016.05.062zbMath1394.90262OpenAlexW2417999841MaRDI QIDQ1752167

Pierre Baptiste, Djamal Rebaine, Mohammed Zouba

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.062

zbMATH Keywords

operatoridentical parallel machinesFPTASfree changing mode

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling identical parallel machines and operators within a period based changing mode
• Cycles and permutations in robotic cells
• Scheduling parallel dedicated machines under a single non-shared resource
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• Approximate Algorithms for the 0/1 Knapsack Problem
• Two-Machine Open Shops with Renewable Resources
• Handbook on Scheduling

This page was built for publication: FPTAS for the two identical parallel machine problem with a single operator under the free changing mode