Scheduling a two-machine robotic cell: A solvable case
From MaRDI portal
Publication:1897386
DOI10.1007/BF02099699zbMath0831.90075MaRDI QIDQ1897386
Konstantin Kogan, Eugene Levner, Ilya Levin
Publication date: 27 August 1995
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (10)
Strategic production planning of an automated manufacturing system through market forecasting ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ New complexity results on scheduling problem in a robotic cell ⋮ Makespan minimization for flow-shop problems with transportation times and a single robot ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ Production planning of a robot-served machine under probabilistic market demand and fixed selling time ⋮ Quantitative production scheme model for an automated manufacturing system
Cites Work
- New trends in machine scheduling
- Optimal planning of part's machining on a number of machines
- Optimal two- and three-stage production schedules with setup times included
- Scheduling of a Two-machine Flowshop with Travel Time Between Machines
- Scheduling Parts in a Combined Production-transportation Work Cell
This page was built for publication: Scheduling a two-machine robotic cell: A solvable case
