Two-machine robotic cell scheduling problem with sequence-dependent setup times

DOI10.1016/J.COR.2012.09.006zbMath1352.90037OpenAlexW1975755304MaRDI QIDQ502461

Yong-Cai Geng, Sumit K. Garg

Publication date: 5 January 2017

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.09.006

zbMATH Keywords

simulated annealingbranch and boundsequence-dependent setup timesmixed-integer linear programmingrobotic cell schedulingTaguchi

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Artificial intelligence for robotics (68T40)

Related Items (10)

Integrated strategic and tactical supply chain planning with price-sensitive demands ⋮ A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters ⋮ A new approach for maintenance scheduling of generating units in electrical power systems based on their operational hours ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells ⋮ Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products ⋮ An optimization-based approach for the healthcare districting under uncertainty ⋮ Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics ⋮ Robotics and Control Systems

This page was built for publication: Two-machine robotic cell scheduling problem with sequence-dependent setup times